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/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:57:29,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:57:29,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:57:29,691 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:57:29,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:57:29,692 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:57:29,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:57:29,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:57:29,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:57:29,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:57:29,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:57:29,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:57:29,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:57:29,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:57:29,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:57:29,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:57:29,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:57:29,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:57:29,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:57:29,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:57:29,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:57:29,710 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:57:29,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:57:29,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:57:29,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:57:29,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:57:29,713 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:57:29,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:57:29,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:57:29,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:57:29,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:57:29,715 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-11 13:57:29,735 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:57:29,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:57:29,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:57:29,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:57:29,736 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:57:29,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:57:29,737 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:57:29,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:57:29,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:57:29,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:57:29,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:57:29,738 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:57:29,738 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:57:29,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:57:29,738 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:57:29,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:57:29,738 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:57:29,739 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:57:29,739 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:57:29,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:57:29,739 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:57:29,739 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-11 13:57:29,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:57:29,778 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:57:29,782 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:57:29,784 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:57:29,784 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:57:29,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-11 13:57:30,084 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3b2444a8d [2018-04-11 13:57:30,173 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:57:30,173 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:57:30,173 INFO L168 CDTParser]: Scanning ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-11 13:57:30,174 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:57:30,174 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:57:30,174 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:57:30,174 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-11 13:57:30,174 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-11 13:57:30,174 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:57:30,174 INFO L233 ultiparseSymbolTable]: [2018-04-11 13:57:30,187 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3b2444a8d [2018-04-11 13:57:30,191 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:57:30,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:57:30,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:57:30,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:57:30,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:57:30,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e5ee10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30, skipping insertion in model container [2018-04-11 13:57:30,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,210 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:57:30,217 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:57:30,301 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:57:30,322 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:57:30,326 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-11 13:57:30,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30 WrapperNode [2018-04-11 13:57:30,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:57:30,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:57:30,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:57:30,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:57:30,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... [2018-04-11 13:57:30,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:57:30,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:57:30,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:57:30,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:57:30,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:57:30,389 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:57:30,389 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:57:30,389 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-11 13:57:30,389 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:57:30,389 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:57:30,390 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 13:57:30,390 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 13:57:30,595 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:57:30,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:57:30 BoogieIcfgContainer [2018-04-11 13:57:30,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:57:30,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:57:30,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:57:30,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:57:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:57:30" (1/3) ... [2018-04-11 13:57:30,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359c2122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:57:30, skipping insertion in model container [2018-04-11 13:57:30,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:57:30" (2/3) ... [2018-04-11 13:57:30,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359c2122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:57:30, skipping insertion in model container [2018-04-11 13:57:30,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:57:30" (3/3) ... [2018-04-11 13:57:30,600 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-11 13:57:30,607 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:57:30,612 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-11 13:57:30,643 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:57:30,644 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:57:30,644 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:57:30,644 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:57:30,644 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:57:30,644 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:57:30,644 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:57:30,644 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:57:30,644 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:57:30,645 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:57:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-11 13:57:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 13:57:30,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:30,662 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:30,662 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-04-11 13:57:30,704 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:30,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:30,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:57:30,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:57:30,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:30,795 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-04-11 13:57:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:30,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:57:30,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:57:30,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:57:30,808 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-11 13:57:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:30,864 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-11 13:57:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:57:30,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 13:57:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:30,871 INFO L225 Difference]: With dead ends: 63 [2018-04-11 13:57:30,871 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 13:57:30,872 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-11 13:57:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 13:57:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-11 13:57:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 13:57:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-11 13:57:30,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-11 13:57:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:30,898 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-11 13:57:30,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:57:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-11 13:57:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 13:57:30,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:30,899 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:30,899 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-04-11 13:57:30,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:30,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:30,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:57:30,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:57:30,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:30,964 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= 0 main_~i~1), 167#(= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|), 168#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 0))] [2018-04-11 13:57:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:30,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:57:30,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:57:30,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:57:30,966 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-04-11 13:57:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,051 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-04-11 13:57:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:57:31,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 13:57:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,052 INFO L225 Difference]: With dead ends: 65 [2018-04-11 13:57:31,052 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 13:57:31,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:57:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 13:57:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-04-11 13:57:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 13:57:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-04-11 13:57:31,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-04-11 13:57:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,057 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-04-11 13:57:31,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:57:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-04-11 13:57:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 13:57:31,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,058 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-11 13:57:31,058 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-04-11 13:57:31,059 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,105 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-11 13:57:31,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:57:31,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:57:31,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,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-11 13:57:31,106 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(<= 0 main_~i~1), 295#(<= 1 main_~i~1), 296#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-04-11 13:57:31,106 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-11 13:57:31,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:57:31,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:57:31,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:57:31,106 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-04-11 13:57:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,140 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-04-11 13:57:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:57:31,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 13:57:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,141 INFO L225 Difference]: With dead ends: 65 [2018-04-11 13:57:31,141 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 13:57:31,141 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-11 13:57:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 13:57:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-04-11 13:57:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 13:57:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-04-11 13:57:31,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-04-11 13:57:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,146 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-04-11 13:57:31,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:57:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-04-11 13:57:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 13:57:31,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,147 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:31,147 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-04-11 13:57:31,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 13:57:31,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:57:31,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 13:57:31,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,186 INFO L182 omatonBuilderFactory]: Interpolants [416#false, 417#(= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0), 415#true] [2018-04-11 13:57:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 13:57:31,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:57:31,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:57:31,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:57:31,187 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-04-11 13:57:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,219 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-04-11 13:57:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:57:31,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-11 13:57:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,221 INFO L225 Difference]: With dead ends: 64 [2018-04-11 13:57:31,221 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 13:57:31,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:57:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 13:57:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-04-11 13:57:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 13:57:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-04-11 13:57:31,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-04-11 13:57:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,224 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-04-11 13:57:31,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:57:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-04-11 13:57:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:57:31,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,225 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:31,225 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-04-11 13:57:31,226 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 13:57:31,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:31,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:57:31,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,308 INFO L182 omatonBuilderFactory]: Interpolants [544#(and (<= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 31) (= 32 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base))), 538#true, 539#false, 540#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 541#(and (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset)), 542#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) (= 32 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|))), 543#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= 32 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)))] [2018-04-11 13:57:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 13:57:31,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:57:31,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:57:31,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:57:31,308 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2018-04-11 13:57:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,393 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-04-11 13:57:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:57:31,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-04-11 13:57:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,394 INFO L225 Difference]: With dead ends: 58 [2018-04-11 13:57:31,394 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 13:57:31,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 13:57:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-04-11 13:57:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 13:57:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-04-11 13:57:31,397 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 29 [2018-04-11 13:57:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,397 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-04-11 13:57:31,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:57:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-04-11 13:57:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 13:57:31,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,398 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:31,398 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-04-11 13:57:31,399 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 13:57:31,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:31,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 13:57:31,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,449 INFO L182 omatonBuilderFactory]: Interpolants [666#true, 667#false, 668#(= 1 (select |#valid| |main_~#mask~0.base|)), 669#(= 1 (select |#valid| main_~c~0.base)), 670#(= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)), 671#(= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base))] [2018-04-11 13:57:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 13:57:31,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:57:31,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:57:31,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:57:31,450 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-04-11 13:57:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,497 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-04-11 13:57:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:57:31,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-04-11 13:57:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,498 INFO L225 Difference]: With dead ends: 54 [2018-04-11 13:57:31,498 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 13:57:31,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 13:57:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 13:57:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 13:57:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-04-11 13:57:31,501 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-04-11 13:57:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,502 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-04-11 13:57:31,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:57:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-04-11 13:57:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:57:31,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,502 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-11 13:57:31,502 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-04-11 13:57:31,503 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:31,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:57:31,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,556 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(= main_~i~1 0), 788#(= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0), 789#(= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#res| 0), 790#(and (= |main_#t~ret3| 0) (= main_~i~1 0)), 791#(= (select main_~b~0 0) 0), 792#(= main_~i~1 (select main_~b~0 main_~i~1))] [2018-04-11 13:57:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:57:31,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:57:31,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:31,557 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-04-11 13:57:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,669 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-04-11 13:57:31,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:57:31,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-11 13:57:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,672 INFO L225 Difference]: With dead ends: 80 [2018-04-11 13:57:31,672 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 13:57:31,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:57:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 13:57:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-04-11 13:57:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 13:57:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-04-11 13:57:31,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 31 [2018-04-11 13:57:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,678 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-04-11 13:57:31,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:57:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-04-11 13:57:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:57:31,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,679 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:31,679 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-04-11 13:57:31,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:31,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:57:31,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,741 INFO L182 omatonBuilderFactory]: Interpolants [944#(= main_~i~1 0), 945#(<= main_~i~1 1), 946#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 1), 947#(<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1), 948#(<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 1)), 949#(<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0), 942#true, 943#false] [2018-04-11 13:57:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:57:31,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:57:31,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:31,742 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2018-04-11 13:57:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,847 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-04-11 13:57:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:57:31,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-11 13:57:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,851 INFO L225 Difference]: With dead ends: 92 [2018-04-11 13:57:31,851 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 13:57:31,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 13:57:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-04-11 13:57:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 13:57:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-11 13:57:31,856 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-04-11 13:57:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,857 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-11 13:57:31,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:57:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-11 13:57:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 13:57:31,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,858 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 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-11 13:57:31,858 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 2 times [2018-04-11 13:57:31,859 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 13:57:31,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:31,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 13:57:31,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:31,897 INFO L182 omatonBuilderFactory]: Interpolants [1125#true, 1126#false, 1127#(= main_~i~1 0), 1128#(<= main_~i~1 1), 1129#(<= main_~i~1 2)] [2018-04-11 13:57:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 13:57:31,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:57:31,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:57:31,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:57:31,897 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 5 states. [2018-04-11 13:57:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:31,942 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-04-11 13:57:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:57:31,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 13:57:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:31,944 INFO L225 Difference]: With dead ends: 108 [2018-04-11 13:57:31,944 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 13:57:31,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 13:57:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 13:57:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2018-04-11 13:57:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 13:57:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-04-11 13:57:31,950 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 43 [2018-04-11 13:57:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:31,951 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-04-11 13:57:31,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:57:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-04-11 13:57:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 13:57:31,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:31,952 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:31,952 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 763161719, now seen corresponding path program 2 times [2018-04-11 13:57:31,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:31,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:57:32,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:57:32,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:57:32,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:32,022 INFO L182 omatonBuilderFactory]: Interpolants [1328#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 1329#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 1330#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 0), 1324#true, 1325#false, 1326#(<= 0 main_~i~1), 1327#(<= 1 main_~i~1)] [2018-04-11 13:57:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:57:32,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:57:32,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:57:32,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:57:32,023 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 7 states. [2018-04-11 13:57:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:32,119 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-04-11 13:57:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:57:32,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-11 13:57:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:32,120 INFO L225 Difference]: With dead ends: 100 [2018-04-11 13:57:32,120 INFO L226 Difference]: Without dead ends: 94 [2018-04-11 13:57:32,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-11 13:57:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-04-11 13:57:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 13:57:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-11 13:57:32,125 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 46 [2018-04-11 13:57:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:32,125 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-11 13:57:32,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:57:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-11 13:57:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 13:57:32,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:32,126 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:32,126 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 3 times [2018-04-11 13:57:32,127 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:32,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-11 13:57:32,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:32,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:57:32,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:32,205 INFO L182 omatonBuilderFactory]: Interpolants [1520#false, 1521#(<= main_~i~1 31), 1522#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 31), 1523#(<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 31), 1524#(and (<= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 31)), 1525#(and (<= 1 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 31)), 1526#(and (<= 1 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 30)), 1519#true] [2018-04-11 13:57:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-11 13:57:32,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:57:32,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:57:32,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:32,206 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-04-11 13:57:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:32,275 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-11 13:57:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:57:32,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-04-11 13:57:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:32,276 INFO L225 Difference]: With dead ends: 90 [2018-04-11 13:57:32,276 INFO L226 Difference]: Without dead ends: 90 [2018-04-11 13:57:32,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-11 13:57:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-11 13:57:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-04-11 13:57:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 13:57:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-11 13:57:32,279 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2018-04-11 13:57:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:32,279 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-11 13:57:32,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:57:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-11 13:57:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 13:57:32,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:32,280 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 13:57:32,280 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:32,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1970492696, now seen corresponding path program 1 times [2018-04-11 13:57:32,281 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:32,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-11 13:57:32,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:32,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:57:32,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:57:32,341 INFO L182 omatonBuilderFactory]: Interpolants [1712#(<= main_~i~1 3), 1707#true, 1708#false, 1709#(= main_~i~1 0), 1710#(<= main_~i~1 1), 1711#(<= main_~i~1 2)] [2018-04-11 13:57:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-11 13:57:32,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:57:32,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:57:32,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:57:32,342 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-04-11 13:57:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:32,392 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-04-11 13:57:32,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:57:32,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-04-11 13:57:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:32,393 INFO L225 Difference]: With dead ends: 122 [2018-04-11 13:57:32,393 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 13:57:32,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:57:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 13:57:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2018-04-11 13:57:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 13:57:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-04-11 13:57:32,399 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 67 [2018-04-11 13:57:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:32,400 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-04-11 13:57:32,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:57:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-04-11 13:57:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 13:57:32,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:32,403 INFO L355 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:32,403 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 2 times [2018-04-11 13:57:32,404 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:32,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-11 13:57:32,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:32,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:57:32,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 13:57:32,470 INFO L182 omatonBuilderFactory]: Interpolants [1936#(<= main_~i~1 4), 1930#true, 1931#false, 1932#(= main_~i~1 0), 1933#(<= main_~i~1 1), 1934#(<= main_~i~1 2), 1935#(<= main_~i~1 3)] [2018-04-11 13:57:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-11 13:57:32,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:57:32,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:57:32,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:57:32,471 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 7 states. [2018-04-11 13:57:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:32,520 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-04-11 13:57:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:57:32,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-04-11 13:57:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:32,521 INFO L225 Difference]: With dead ends: 138 [2018-04-11 13:57:32,521 INFO L226 Difference]: Without dead ends: 138 [2018-04-11 13:57:32,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:57:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-11 13:57:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2018-04-11 13:57:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 13:57:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-04-11 13:57:32,523 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 85 [2018-04-11 13:57:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:32,524 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-04-11 13:57:32,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:57:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-04-11 13:57:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-11 13:57:32,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:32,525 INFO L355 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:32,525 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash -825580742, now seen corresponding path program 3 times [2018-04-11 13:57:32,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:32,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-11 13:57:32,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:32,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:57:32,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-11 13:57:32,607 INFO L182 omatonBuilderFactory]: Interpolants [2181#true, 2182#false, 2183#(= main_~i~1 0), 2184#(<= main_~i~1 1), 2185#(<= main_~i~1 2), 2186#(<= main_~i~1 3), 2187#(<= main_~i~1 4), 2188#(<= main_~i~1 5)] [2018-04-11 13:57:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-11 13:57:32,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:57:32,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:57:32,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:32,608 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 8 states. [2018-04-11 13:57:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:32,691 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-04-11 13:57:32,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:57:32,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2018-04-11 13:57:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:32,692 INFO L225 Difference]: With dead ends: 154 [2018-04-11 13:57:32,693 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 13:57:32,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 13:57:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-04-11 13:57:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 13:57:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-04-11 13:57:32,697 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 103 [2018-04-11 13:57:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:32,697 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-04-11 13:57:32,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:57:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-04-11 13:57:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-04-11 13:57:32,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:32,699 INFO L355 BasicCegarLoop]: trace histogram [11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:32,699 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash 797540099, now seen corresponding path program 4 times [2018-04-11 13:57:32,700 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:32,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-04-11 13:57:32,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:32,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:57:32,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-04-11 13:57:32,780 INFO L182 omatonBuilderFactory]: Interpolants [2464#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 1), 2465#(<= main_~i~1 1), 2466#(<= main_~i~1 2), 2460#true, 2461#false, 2462#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 2463#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1))] [2018-04-11 13:57:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-04-11 13:57:32,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 13:57:32,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 13:57:32,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:57:32,781 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 7 states. [2018-04-11 13:57:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:32,880 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-04-11 13:57:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:57:32,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-04-11 13:57:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:32,882 INFO L225 Difference]: With dead ends: 168 [2018-04-11 13:57:32,882 INFO L226 Difference]: Without dead ends: 168 [2018-04-11 13:57:32,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:57:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-11 13:57:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2018-04-11 13:57:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 13:57:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-04-11 13:57:32,888 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 121 [2018-04-11 13:57:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:32,889 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-04-11 13:57:32,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 13:57:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-04-11 13:57:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-11 13:57:32,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:32,890 INFO L355 BasicCegarLoop]: trace histogram [12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:32,890 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1854228341, now seen corresponding path program 5 times [2018-04-11 13:57:32,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:32,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-04-11 13:57:32,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:32,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:57:32,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-04-11 13:57:32,988 INFO L182 omatonBuilderFactory]: Interpolants [2768#(<= 1 main_~i~1), 2769#(<= 2 main_~i~1), 2770#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 2771#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 2772#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 1), 2765#true, 2766#false, 2767#(<= 0 main_~i~1)] [2018-04-11 13:57:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-04-11 13:57:32,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:57:32,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:57:32,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:32,989 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 8 states. [2018-04-11 13:57:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:33,131 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-11 13:57:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:57:33,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-04-11 13:57:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:33,132 INFO L225 Difference]: With dead ends: 140 [2018-04-11 13:57:33,133 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 13:57:33,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 13:57:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2018-04-11 13:57:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 13:57:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-11 13:57:33,136 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 127 [2018-04-11 13:57:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:33,136 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-11 13:57:33,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:57:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-11 13:57:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-11 13:57:33,138 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:33,138 INFO L355 BasicCegarLoop]: trace histogram [15, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:33,138 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1667069347, now seen corresponding path program 6 times [2018-04-11 13:57:33,139 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:33,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-04-11 13:57:33,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:33,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:57:33,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-04-11 13:57:33,262 INFO L182 omatonBuilderFactory]: Interpolants [3040#true, 3041#false, 3042#(= main_~i~1 0), 3043#(<= main_~i~1 1), 3044#(<= main_~i~1 2), 3045#(<= main_~i~1 3), 3046#(<= main_~i~1 4), 3047#(<= main_~i~1 5), 3048#(<= main_~i~1 6)] [2018-04-11 13:57:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-04-11 13:57:33,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:57:33,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:57:33,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:57:33,263 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 9 states. [2018-04-11 13:57:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:33,339 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-04-11 13:57:33,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:57:33,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2018-04-11 13:57:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:33,340 INFO L225 Difference]: With dead ends: 176 [2018-04-11 13:57:33,341 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 13:57:33,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:57:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 13:57:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2018-04-11 13:57:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 13:57:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2018-04-11 13:57:33,345 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 145 [2018-04-11 13:57:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:33,345 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-04-11 13:57:33,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:57:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2018-04-11 13:57:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-11 13:57:33,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:33,346 INFO L355 BasicCegarLoop]: trace histogram [18, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:33,347 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash -418963468, now seen corresponding path program 7 times [2018-04-11 13:57:33,347 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:33,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 206 proven. 10 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-04-11 13:57:33,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:33,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 13:57:33,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-04-11 13:57:33,497 INFO L182 omatonBuilderFactory]: Interpolants [3360#false, 3361#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 3362#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 3363#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 3364#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 3365#(<= main_~i~1 2), 3366#(<= main_~i~1 3), 3359#true] [2018-04-11 13:57:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 206 proven. 10 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-04-11 13:57:33,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:57:33,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:57:33,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:57:33,498 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand 8 states. [2018-04-11 13:57:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:33,604 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-04-11 13:57:33,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:57:33,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2018-04-11 13:57:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:33,606 INFO L225 Difference]: With dead ends: 193 [2018-04-11 13:57:33,606 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 13:57:33,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:57:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 13:57:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2018-04-11 13:57:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 13:57:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2018-04-11 13:57:33,612 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 169 [2018-04-11 13:57:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:33,612 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2018-04-11 13:57:33,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:57:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2018-04-11 13:57:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-04-11 13:57:33,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:33,613 INFO L355 BasicCegarLoop]: trace histogram [19, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:33,613 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1459740484, now seen corresponding path program 8 times [2018-04-11 13:57:33,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:33,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-04-11 13:57:33,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:33,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:57:33,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-04-11 13:57:33,709 INFO L182 omatonBuilderFactory]: Interpolants [3712#(<= main_~i~1 1), 3713#(<= main_~i~1 2), 3714#(<= main_~i~1 3), 3715#(<= main_~i~1 4), 3716#(<= main_~i~1 5), 3717#(<= main_~i~1 6), 3718#(<= main_~i~1 7), 3709#true, 3710#false, 3711#(= main_~i~1 0)] [2018-04-11 13:57:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2018-04-11 13:57:33,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:57:33,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:57:33,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:33,709 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 10 states. [2018-04-11 13:57:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:33,791 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-04-11 13:57:33,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:57:33,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2018-04-11 13:57:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:33,793 INFO L225 Difference]: With dead ends: 211 [2018-04-11 13:57:33,793 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 13:57:33,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 13:57:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 154. [2018-04-11 13:57:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 13:57:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-04-11 13:57:33,798 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 175 [2018-04-11 13:57:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:33,798 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-04-11 13:57:33,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:57:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-04-11 13:57:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-04-11 13:57:33,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:33,799 INFO L355 BasicCegarLoop]: trace histogram [22, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:33,799 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1367975757, now seen corresponding path program 9 times [2018-04-11 13:57:33,800 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:33,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 201 proven. 172 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2018-04-11 13:57:33,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:33,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:57:33,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-04-11 13:57:33,913 INFO L182 omatonBuilderFactory]: Interpolants [4084#true, 4085#false, 4086#(<= 0 main_~i~1), 4087#(<= 1 main_~i~1), 4088#(<= 2 main_~i~1), 4089#(<= 3 main_~i~1), 4090#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 4091#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 4092#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 4093#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2)] [2018-04-11 13:57:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 201 proven. 172 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2018-04-11 13:57:33,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:57:33,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:57:33,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:33,914 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 10 states. [2018-04-11 13:57:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:34,076 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2018-04-11 13:57:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:57:34,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-04-11 13:57:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:34,077 INFO L225 Difference]: With dead ends: 173 [2018-04-11 13:57:34,077 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 13:57:34,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 13:57:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2018-04-11 13:57:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 13:57:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-04-11 13:57:34,080 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 199 [2018-04-11 13:57:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:34,080 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-04-11 13:57:34,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:57:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-04-11 13:57:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-04-11 13:57:34,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:34,081 INFO L355 BasicCegarLoop]: trace histogram [26, 18, 18, 18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:34,081 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 354968301, now seen corresponding path program 10 times [2018-04-11 13:57:34,082 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:34,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-04-11 13:57:34,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:34,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:57:34,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-11 13:57:34,229 INFO L182 omatonBuilderFactory]: Interpolants [4432#(<= main_~i~1 3), 4433#(<= main_~i~1 4), 4434#(<= main_~i~1 5), 4435#(<= main_~i~1 6), 4436#(<= main_~i~1 7), 4437#(<= main_~i~1 8), 4427#true, 4428#false, 4429#(= main_~i~1 0), 4430#(<= main_~i~1 1), 4431#(<= main_~i~1 2)] [2018-04-11 13:57:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-04-11 13:57:34,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:57:34,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:57:34,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:57:34,231 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 11 states. [2018-04-11 13:57:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:34,341 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-04-11 13:57:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:57:34,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-04-11 13:57:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:34,343 INFO L225 Difference]: With dead ends: 217 [2018-04-11 13:57:34,344 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 13:57:34,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:57:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 13:57:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 165. [2018-04-11 13:57:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 13:57:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2018-04-11 13:57:34,349 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 223 [2018-04-11 13:57:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:34,350 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2018-04-11 13:57:34,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:57:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-04-11 13:57:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-11 13:57:34,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:34,352 INFO L355 BasicCegarLoop]: trace histogram [30, 21, 21, 21, 21, 21, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:34,352 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 704000134, now seen corresponding path program 11 times [2018-04-11 13:57:34,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:34,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 482 proven. 24 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-04-11 13:57:34,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:34,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 13:57:34,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-04-11 13:57:34,536 INFO L182 omatonBuilderFactory]: Interpolants [4820#true, 4821#false, 4822#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 4823#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 4824#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 4825#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 4826#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 4827#(<= main_~i~1 3), 4828#(<= main_~i~1 4)] [2018-04-11 13:57:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 482 proven. 24 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-04-11 13:57:34,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:57:34,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:57:34,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:57:34,538 INFO L87 Difference]: Start difference. First operand 165 states and 183 transitions. Second operand 9 states. [2018-04-11 13:57:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:34,672 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-04-11 13:57:34,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:57:34,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 253 [2018-04-11 13:57:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:34,676 INFO L225 Difference]: With dead ends: 240 [2018-04-11 13:57:34,676 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 13:57:34,677 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 13:57:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 174. [2018-04-11 13:57:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 13:57:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2018-04-11 13:57:34,683 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 253 [2018-04-11 13:57:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:34,683 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2018-04-11 13:57:34,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:57:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2018-04-11 13:57:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-11 13:57:34,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:34,686 INFO L355 BasicCegarLoop]: trace histogram [31, 22, 22, 22, 22, 22, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:34,686 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:34,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1269758926, now seen corresponding path program 12 times [2018-04-11 13:57:34,688 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:34,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 606 proven. 44 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-04-11 13:57:34,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:34,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:57:34,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-04-11 13:57:34,880 INFO L182 omatonBuilderFactory]: Interpolants [5251#true, 5252#false, 5253#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 5254#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 5255#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 5256#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 5257#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 5258#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 5259#(<= main_~i~1 4), 5260#(<= main_~i~1 5)] [2018-04-11 13:57:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 606 proven. 44 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2018-04-11 13:57:34,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:57:34,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:57:34,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:34,882 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand 10 states. [2018-04-11 13:57:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:35,089 INFO L93 Difference]: Finished difference Result 249 states and 297 transitions. [2018-04-11 13:57:35,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:57:35,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-04-11 13:57:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:35,090 INFO L225 Difference]: With dead ends: 249 [2018-04-11 13:57:35,090 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 13:57:35,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 13:57:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2018-04-11 13:57:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 13:57:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-04-11 13:57:35,096 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 259 [2018-04-11 13:57:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:35,097 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-04-11 13:57:35,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:57:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-04-11 13:57:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-04-11 13:57:35,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:35,099 INFO L355 BasicCegarLoop]: trace histogram [32, 23, 23, 23, 23, 23, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:35,099 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1255919338, now seen corresponding path program 13 times [2018-04-11 13:57:35,100 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:35,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-04-11 13:57:35,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:35,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:57:35,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-04-11 13:57:35,290 INFO L182 omatonBuilderFactory]: Interpolants [5700#true, 5701#false, 5702#(= main_~i~1 0), 5703#(<= main_~i~1 1), 5704#(<= main_~i~1 2), 5705#(<= main_~i~1 3), 5706#(<= main_~i~1 4), 5707#(<= main_~i~1 5), 5708#(<= main_~i~1 6), 5709#(<= main_~i~1 7), 5710#(<= main_~i~1 8), 5711#(<= main_~i~1 9)] [2018-04-11 13:57:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2018-04-11 13:57:35,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:57:35,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:57:35,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:57:35,292 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 12 states. [2018-04-11 13:57:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:35,425 INFO L93 Difference]: Finished difference Result 258 states and 280 transitions. [2018-04-11 13:57:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:57:35,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 265 [2018-04-11 13:57:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:35,427 INFO L225 Difference]: With dead ends: 258 [2018-04-11 13:57:35,427 INFO L226 Difference]: Without dead ends: 258 [2018-04-11 13:57:35,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:57:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-11 13:57:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 191. [2018-04-11 13:57:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 13:57:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-04-11 13:57:35,459 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 265 [2018-04-11 13:57:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:35,460 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-04-11 13:57:35,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:57:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-04-11 13:57:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-04-11 13:57:35,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:35,462 INFO L355 BasicCegarLoop]: trace histogram [36, 26, 26, 26, 26, 26, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:35,462 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -478351505, now seen corresponding path program 14 times [2018-04-11 13:57:35,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:35,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 534 proven. 139 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-04-11 13:57:35,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:35,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 13:57:35,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 129 proven. 20 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-04-11 13:57:35,666 INFO L182 omatonBuilderFactory]: Interpolants [6161#true, 6162#false, 6163#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 6164#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 6165#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 6166#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 6167#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 6168#(<= main_~i~1 3), 6169#(<= main_~i~1 4), 6170#(<= main_~i~1 5)] [2018-04-11 13:57:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3030 backedges. 534 proven. 139 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-04-11 13:57:35,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:57:35,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:57:35,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:57:35,668 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 10 states. [2018-04-11 13:57:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:35,835 INFO L93 Difference]: Finished difference Result 303 states and 375 transitions. [2018-04-11 13:57:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:57:35,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2018-04-11 13:57:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:35,836 INFO L225 Difference]: With dead ends: 303 [2018-04-11 13:57:35,836 INFO L226 Difference]: Without dead ends: 303 [2018-04-11 13:57:35,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-11 13:57:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 194. [2018-04-11 13:57:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 13:57:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-04-11 13:57:35,841 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 295 [2018-04-11 13:57:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:35,841 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-04-11 13:57:35,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:57:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-04-11 13:57:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-04-11 13:57:35,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:35,842 INFO L355 BasicCegarLoop]: trace histogram [37, 27, 27, 27, 27, 27, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:35,842 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1133567817, now seen corresponding path program 15 times [2018-04-11 13:57:35,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:35,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3206 backedges. 658 proven. 191 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-04-11 13:57:36,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:36,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:57:36,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 114 proven. 26 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-04-11 13:57:36,012 INFO L182 omatonBuilderFactory]: Interpolants [6676#true, 6677#false, 6678#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 6679#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 6680#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 6681#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 6682#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 6683#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 6684#(<= main_~i~1 4), 6685#(<= main_~i~1 5), 6686#(<= main_~i~1 6)] [2018-04-11 13:57:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3206 backedges. 658 proven. 191 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2018-04-11 13:57:36,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:57:36,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:57:36,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:57:36,014 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 11 states. [2018-04-11 13:57:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:36,222 INFO L93 Difference]: Finished difference Result 307 states and 379 transitions. [2018-04-11 13:57:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:57:36,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 301 [2018-04-11 13:57:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:36,224 INFO L225 Difference]: With dead ends: 307 [2018-04-11 13:57:36,224 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 13:57:36,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 13:57:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 191. [2018-04-11 13:57:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 13:57:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-04-11 13:57:36,232 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 301 [2018-04-11 13:57:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:36,233 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-04-11 13:57:36,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:57:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-04-11 13:57:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-11 13:57:36,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:36,235 INFO L355 BasicCegarLoop]: trace histogram [38, 28, 28, 28, 28, 28, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:36,235 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1980154881, now seen corresponding path program 16 times [2018-04-11 13:57:36,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:36,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3388 backedges. 909 proven. 70 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2018-04-11 13:57:36,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:36,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:57:36,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-04-11 13:57:36,512 INFO L182 omatonBuilderFactory]: Interpolants [7200#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 7201#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 7202#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 7203#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 7204#(<= main_~i~1 5), 7205#(<= main_~i~1 6), 7195#true, 7196#false, 7197#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 7198#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 7199#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2))] [2018-04-11 13:57:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3388 backedges. 909 proven. 70 refuted. 0 times theorem prover too weak. 2409 trivial. 0 not checked. [2018-04-11 13:57:36,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:57:36,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:57:36,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:57:36,514 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 11 states. [2018-04-11 13:57:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:36,666 INFO L93 Difference]: Finished difference Result 277 states and 347 transitions. [2018-04-11 13:57:36,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:57:36,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 307 [2018-04-11 13:57:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:36,669 INFO L225 Difference]: With dead ends: 277 [2018-04-11 13:57:36,669 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 13:57:36,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:57:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 13:57:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2018-04-11 13:57:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 13:57:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 237 transitions. [2018-04-11 13:57:36,676 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 237 transitions. Word has length 307 [2018-04-11 13:57:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:36,677 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 237 transitions. [2018-04-11 13:57:36,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:57:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 237 transitions. [2018-04-11 13:57:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-04-11 13:57:36,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:36,679 INFO L355 BasicCegarLoop]: trace histogram [39, 29, 29, 29, 29, 29, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:36,679 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1120913543, now seen corresponding path program 17 times [2018-04-11 13:57:36,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:36,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 374 proven. 479 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2018-04-11 13:57:36,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:36,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:57:36,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 37 proven. 109 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-04-11 13:57:36,968 INFO L182 omatonBuilderFactory]: Interpolants [7696#false, 7697#(<= 0 main_~i~1), 7698#(<= 1 main_~i~1), 7699#(<= 2 main_~i~1), 7700#(<= 3 main_~i~1), 7701#(<= 4 main_~i~1), 7702#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 7703#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 7704#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 7705#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 7706#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 7695#true] [2018-04-11 13:57:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 374 proven. 479 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2018-04-11 13:57:36,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:57:36,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:57:36,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:57:36,970 INFO L87 Difference]: Start difference. First operand 200 states and 237 transitions. Second operand 12 states. [2018-04-11 13:57:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:37,191 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2018-04-11 13:57:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:57:37,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2018-04-11 13:57:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:37,193 INFO L225 Difference]: With dead ends: 223 [2018-04-11 13:57:37,193 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 13:57:37,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 13:57:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2018-04-11 13:57:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 13:57:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2018-04-11 13:57:37,201 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 241 transitions. Word has length 313 [2018-04-11 13:57:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:37,201 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 241 transitions. [2018-04-11 13:57:37,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:57:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2018-04-11 13:57:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-11 13:57:37,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:37,204 INFO L355 BasicCegarLoop]: trace histogram [43, 33, 33, 33, 33, 33, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:37,204 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1555650855, now seen corresponding path program 18 times [2018-04-11 13:57:37,204 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:37,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-04-11 13:57:37,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:37,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:57:37,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-04-11 13:57:37,480 INFO L182 omatonBuilderFactory]: Interpolants [8141#true, 8142#false, 8143#(= main_~i~1 0), 8144#(<= main_~i~1 1), 8145#(<= main_~i~1 2), 8146#(<= main_~i~1 3), 8147#(<= main_~i~1 4), 8148#(<= main_~i~1 5), 8149#(<= main_~i~1 6), 8150#(<= main_~i~1 7), 8151#(<= main_~i~1 8), 8152#(<= main_~i~1 9), 8153#(<= main_~i~1 10)] [2018-04-11 13:57:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2018-04-11 13:57:37,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:57:37,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:57:37,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:37,481 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. Second operand 13 states. [2018-04-11 13:57:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:37,661 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2018-04-11 13:57:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:57:37,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 337 [2018-04-11 13:57:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:37,663 INFO L225 Difference]: With dead ends: 306 [2018-04-11 13:57:37,663 INFO L226 Difference]: Without dead ends: 306 [2018-04-11 13:57:37,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-11 13:57:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 214. [2018-04-11 13:57:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 13:57:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-04-11 13:57:37,670 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 337 [2018-04-11 13:57:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:37,671 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-04-11 13:57:37,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:57:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-04-11 13:57:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-04-11 13:57:37,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:37,674 INFO L355 BasicCegarLoop]: trace histogram [48, 37, 37, 37, 37, 37, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:37,674 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1011854648, now seen corresponding path program 19 times [2018-04-11 13:57:37,675 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:37,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5492 backedges. 814 proven. 370 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2018-04-11 13:57:37,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:37,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:57:37,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 150 proven. 52 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-04-11 13:57:37,989 INFO L182 omatonBuilderFactory]: Interpolants [8674#true, 8675#false, 8676#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 8677#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 8678#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 8679#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 8680#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 8681#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 8682#(<= main_~i~1 4), 8683#(<= main_~i~1 5), 8684#(<= main_~i~1 6), 8685#(<= main_~i~1 7)] [2018-04-11 13:57:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5492 backedges. 814 proven. 370 refuted. 0 times theorem prover too weak. 4308 trivial. 0 not checked. [2018-04-11 13:57:37,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:57:37,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:57:37,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:57:37,990 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-04-11 13:57:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:38,170 INFO L93 Difference]: Finished difference Result 370 states and 469 transitions. [2018-04-11 13:57:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:57:38,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 373 [2018-04-11 13:57:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:38,174 INFO L225 Difference]: With dead ends: 370 [2018-04-11 13:57:38,174 INFO L226 Difference]: Without dead ends: 370 [2018-04-11 13:57:38,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:57:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-11 13:57:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 214. [2018-04-11 13:57:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 13:57:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-04-11 13:57:38,184 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 373 [2018-04-11 13:57:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:38,184 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-04-11 13:57:38,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:57:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-04-11 13:57:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-04-11 13:57:38,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:38,187 INFO L355 BasicCegarLoop]: trace histogram [49, 38, 38, 38, 38, 38, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:38,187 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash -339687920, now seen corresponding path program 20 times [2018-04-11 13:57:38,188 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:38,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 1095 proven. 281 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2018-04-11 13:57:38,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:38,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:57:38,443 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 173 proven. 32 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-04-11 13:57:38,443 INFO L182 omatonBuilderFactory]: Interpolants [9280#true, 9281#false, 9282#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 9283#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 9284#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 9285#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 9286#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 9287#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 9288#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 9289#(<= main_~i~1 5), 9290#(<= main_~i~1 6), 9291#(<= main_~i~1 7)] [2018-04-11 13:57:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 1095 proven. 281 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2018-04-11 13:57:38,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:57:38,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:57:38,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:57:38,444 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-04-11 13:57:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:38,662 INFO L93 Difference]: Finished difference Result 341 states and 426 transitions. [2018-04-11 13:57:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:57:38,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 379 [2018-04-11 13:57:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:38,666 INFO L225 Difference]: With dead ends: 341 [2018-04-11 13:57:38,666 INFO L226 Difference]: Without dead ends: 341 [2018-04-11 13:57:38,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:57:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-11 13:57:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 214. [2018-04-11 13:57:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 13:57:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2018-04-11 13:57:38,674 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 379 [2018-04-11 13:57:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:38,675 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2018-04-11 13:57:38,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:57:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2018-04-11 13:57:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-04-11 13:57:38,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:38,678 INFO L355 BasicCegarLoop]: trace histogram [50, 39, 39, 39, 39, 39, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:38,678 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 77081240, now seen corresponding path program 21 times [2018-04-11 13:57:38,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:38,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 1466 proven. 102 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-11 13:57:39,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:39,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:57:39,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-04-11 13:57:39,026 INFO L182 omatonBuilderFactory]: Interpolants [9859#true, 9860#false, 9861#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 9862#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 9863#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 9864#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 9865#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 9866#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 9867#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 9868#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 9869#(<= main_~i~1 6), 9870#(<= main_~i~1 7)] [2018-04-11 13:57:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 1466 proven. 102 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-11 13:57:39,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:57:39,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:57:39,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:57:39,027 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand 12 states. [2018-04-11 13:57:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:39,255 INFO L93 Difference]: Finished difference Result 305 states and 387 transitions. [2018-04-11 13:57:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 13:57:39,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 385 [2018-04-11 13:57:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:39,283 INFO L225 Difference]: With dead ends: 305 [2018-04-11 13:57:39,283 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 13:57:39,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:57:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 13:57:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 223. [2018-04-11 13:57:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 13:57:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2018-04-11 13:57:39,290 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 385 [2018-04-11 13:57:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:39,291 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2018-04-11 13:57:39,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:57:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2018-04-11 13:57:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-04-11 13:57:39,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:39,294 INFO L355 BasicCegarLoop]: trace histogram [51, 40, 40, 40, 40, 40, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:39,294 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2006818912, now seen corresponding path program 22 times [2018-04-11 13:57:39,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:39,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6242 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-04-11 13:57:39,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:39,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:57:39,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-04-11 13:57:39,626 INFO L182 omatonBuilderFactory]: Interpolants [10413#true, 10414#false, 10415#(= main_~i~1 0), 10416#(<= main_~i~1 1), 10417#(<= main_~i~1 2), 10418#(<= main_~i~1 3), 10419#(<= main_~i~1 4), 10420#(<= main_~i~1 5), 10421#(<= main_~i~1 6), 10422#(<= main_~i~1 7), 10423#(<= main_~i~1 8), 10424#(<= main_~i~1 9), 10425#(<= main_~i~1 10), 10426#(<= main_~i~1 11)] [2018-04-11 13:57:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6242 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-04-11 13:57:39,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:57:39,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:57:39,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:39,627 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand 14 states. [2018-04-11 13:57:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:39,821 INFO L93 Difference]: Finished difference Result 357 states and 434 transitions. [2018-04-11 13:57:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:57:39,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 391 [2018-04-11 13:57:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:39,823 INFO L225 Difference]: With dead ends: 357 [2018-04-11 13:57:39,824 INFO L226 Difference]: Without dead ends: 357 [2018-04-11 13:57:39,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-11 13:57:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 234. [2018-04-11 13:57:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 13:57:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-04-11 13:57:39,831 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 391 [2018-04-11 13:57:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:39,832 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-04-11 13:57:39,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:57:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-04-11 13:57:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-11 13:57:39,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:39,835 INFO L355 BasicCegarLoop]: trace histogram [56, 44, 44, 44, 44, 44, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:39,835 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1326020417, now seen corresponding path program 23 times [2018-04-11 13:57:39,836 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:39,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7548 backedges. 866 proven. 581 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2018-04-11 13:57:40,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:40,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:57:40,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-04-11 13:57:40,220 INFO L182 omatonBuilderFactory]: Interpolants [11018#true, 11019#false, 11020#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 11021#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 11022#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 11023#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 11024#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 11025#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 11026#(<= main_~i~1 4), 11027#(<= main_~i~1 5), 11028#(<= main_~i~1 6), 11029#(<= main_~i~1 7), 11030#(<= main_~i~1 8)] [2018-04-11 13:57:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7548 backedges. 866 proven. 581 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2018-04-11 13:57:40,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:57:40,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:57:40,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:40,221 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-04-11 13:57:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:40,422 INFO L93 Difference]: Finished difference Result 437 states and 597 transitions. [2018-04-11 13:57:40,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:57:40,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 427 [2018-04-11 13:57:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:40,427 INFO L225 Difference]: With dead ends: 437 [2018-04-11 13:57:40,427 INFO L226 Difference]: Without dead ends: 437 [2018-04-11 13:57:40,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:57:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-11 13:57:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 234. [2018-04-11 13:57:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 13:57:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-04-11 13:57:40,439 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 427 [2018-04-11 13:57:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:40,440 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-04-11 13:57:40,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:57:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-04-11 13:57:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-04-11 13:57:40,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:40,443 INFO L355 BasicCegarLoop]: trace histogram [57, 45, 45, 45, 45, 45, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:40,443 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1293788297, now seen corresponding path program 24 times [2018-04-11 13:57:40,444 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:40,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7836 backedges. 1153 proven. 530 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-04-11 13:57:40,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:40,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:57:40,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 173 proven. 64 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-04-11 13:57:40,887 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 11715#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 11716#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 11717#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 11718#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 11719#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 11720#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 11721#(<= main_~i~1 5), 11722#(<= main_~i~1 6), 11723#(<= main_~i~1 7), 11724#(<= main_~i~1 8)] [2018-04-11 13:57:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7836 backedges. 1153 proven. 530 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-04-11 13:57:40,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:57:40,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:57:40,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:40,889 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-04-11 13:57:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:41,129 INFO L93 Difference]: Finished difference Result 410 states and 555 transitions. [2018-04-11 13:57:41,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 13:57:41,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 433 [2018-04-11 13:57:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:41,132 INFO L225 Difference]: With dead ends: 410 [2018-04-11 13:57:41,133 INFO L226 Difference]: Without dead ends: 410 [2018-04-11 13:57:41,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:57:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-11 13:57:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 234. [2018-04-11 13:57:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 13:57:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-04-11 13:57:41,142 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 433 [2018-04-11 13:57:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:41,143 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-04-11 13:57:41,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:57:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-04-11 13:57:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-04-11 13:57:41,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:41,146 INFO L355 BasicCegarLoop]: trace histogram [58, 46, 46, 46, 46, 46, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:41,146 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:41,146 INFO L82 PathProgramCache]: Analyzing trace with hash -456174831, now seen corresponding path program 25 times [2018-04-11 13:57:41,147 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:41,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8130 backedges. 1530 proven. 389 refuted. 0 times theorem prover too weak. 6211 trivial. 0 not checked. [2018-04-11 13:57:41,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:41,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:57:41,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 211 proven. 38 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-04-11 13:57:41,577 INFO L182 omatonBuilderFactory]: Interpolants [12384#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 12385#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 12386#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 12387#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 12388#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 12389#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 12390#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 12391#(<= main_~i~1 6), 12392#(<= main_~i~1 7), 12393#(<= main_~i~1 8), 12381#true, 12382#false, 12383#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0))] [2018-04-11 13:57:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8130 backedges. 1530 proven. 389 refuted. 0 times theorem prover too weak. 6211 trivial. 0 not checked. [2018-04-11 13:57:41,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:57:41,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:57:41,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:41,579 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-04-11 13:57:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:41,787 INFO L93 Difference]: Finished difference Result 375 states and 497 transitions. [2018-04-11 13:57:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 13:57:41,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 439 [2018-04-11 13:57:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:41,790 INFO L225 Difference]: With dead ends: 375 [2018-04-11 13:57:41,790 INFO L226 Difference]: Without dead ends: 375 [2018-04-11 13:57:41,790 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:57:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-04-11 13:57:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 234. [2018-04-11 13:57:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 13:57:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2018-04-11 13:57:41,798 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 439 [2018-04-11 13:57:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:41,799 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-04-11 13:57:41,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:57:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2018-04-11 13:57:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-04-11 13:57:41,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:41,802 INFO L355 BasicCegarLoop]: trace histogram [59, 47, 47, 47, 47, 47, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:41,802 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1762811175, now seen corresponding path program 26 times [2018-04-11 13:57:41,803 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:41,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8430 backedges. 2015 proven. 140 refuted. 0 times theorem prover too weak. 6275 trivial. 0 not checked. [2018-04-11 13:57:42,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:42,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:57:42,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2018-04-11 13:57:42,241 INFO L182 omatonBuilderFactory]: Interpolants [13024#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 13025#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 13026#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 13027#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 13028#(<= main_~i~1 7), 13029#(<= main_~i~1 8), 13017#true, 13018#false, 13019#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 13020#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 13021#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 13022#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 13023#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4))] [2018-04-11 13:57:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8430 backedges. 2015 proven. 140 refuted. 0 times theorem prover too weak. 6275 trivial. 0 not checked. [2018-04-11 13:57:42,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:57:42,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:57:42,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:57:42,242 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand 13 states. [2018-04-11 13:57:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:42,429 INFO L93 Difference]: Finished difference Result 333 states and 443 transitions. [2018-04-11 13:57:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:57:42,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 445 [2018-04-11 13:57:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:42,431 INFO L225 Difference]: With dead ends: 333 [2018-04-11 13:57:42,431 INFO L226 Difference]: Without dead ends: 333 [2018-04-11 13:57:42,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:57:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-11 13:57:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 243. [2018-04-11 13:57:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 13:57:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 309 transitions. [2018-04-11 13:57:42,436 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 309 transitions. Word has length 445 [2018-04-11 13:57:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:42,437 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 309 transitions. [2018-04-11 13:57:42,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:57:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 309 transitions. [2018-04-11 13:57:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-04-11 13:57:42,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:42,439 INFO L355 BasicCegarLoop]: trace histogram [60, 48, 48, 48, 48, 48, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:42,439 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1871830047, now seen corresponding path program 27 times [2018-04-11 13:57:42,440 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:42,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8736 backedges. 631 proven. 1006 refuted. 0 times theorem prover too weak. 7099 trivial. 0 not checked. [2018-04-11 13:57:42,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:42,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:57:42,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 63 proven. 162 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2018-04-11 13:57:42,781 INFO L182 omatonBuilderFactory]: Interpolants [13632#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 13633#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 13634#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 13635#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 13622#true, 13623#false, 13624#(<= 0 main_~i~1), 13625#(<= 1 main_~i~1), 13626#(<= 2 main_~i~1), 13627#(<= 3 main_~i~1), 13628#(<= 4 main_~i~1), 13629#(<= 5 main_~i~1), 13630#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 13631#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1))] [2018-04-11 13:57:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8736 backedges. 631 proven. 1006 refuted. 0 times theorem prover too weak. 7099 trivial. 0 not checked. [2018-04-11 13:57:42,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:57:42,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:57:42,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:42,782 INFO L87 Difference]: Start difference. First operand 243 states and 309 transitions. Second operand 14 states. [2018-04-11 13:57:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:43,013 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2018-04-11 13:57:43,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:57:43,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 451 [2018-04-11 13:57:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:43,014 INFO L225 Difference]: With dead ends: 268 [2018-04-11 13:57:43,014 INFO L226 Difference]: Without dead ends: 268 [2018-04-11 13:57:43,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:57:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-11 13:57:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-04-11 13:57:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 13:57:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 302 transitions. [2018-04-11 13:57:43,018 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 302 transitions. Word has length 451 [2018-04-11 13:57:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:43,018 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 302 transitions. [2018-04-11 13:57:43,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:57:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 302 transitions. [2018-04-11 13:57:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-04-11 13:57:43,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:43,021 INFO L355 BasicCegarLoop]: trace histogram [63, 51, 51, 51, 51, 51, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:43,021 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash -872769991, now seen corresponding path program 28 times [2018-04-11 13:57:43,021 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:43,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9270 trivial. 0 not checked. [2018-04-11 13:57:43,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:43,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:57:43,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2018-04-11 13:57:43,480 INFO L182 omatonBuilderFactory]: Interpolants [14157#true, 14158#false, 14159#(= main_~i~1 0), 14160#(<= main_~i~1 1), 14161#(<= main_~i~1 2), 14162#(<= main_~i~1 3), 14163#(<= main_~i~1 4), 14164#(<= main_~i~1 5), 14165#(<= main_~i~1 6), 14166#(<= main_~i~1 7), 14167#(<= main_~i~1 8), 14168#(<= main_~i~1 9), 14169#(<= main_~i~1 10), 14170#(<= main_~i~1 11), 14171#(<= main_~i~1 12)] [2018-04-11 13:57:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9270 trivial. 0 not checked. [2018-04-11 13:57:43,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:57:43,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:57:43,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:43,481 INFO L87 Difference]: Start difference. First operand 243 states and 302 transitions. Second operand 15 states. [2018-04-11 13:57:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:43,658 INFO L93 Difference]: Finished difference Result 382 states and 466 transitions. [2018-04-11 13:57:43,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:57:43,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 469 [2018-04-11 13:57:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:43,660 INFO L225 Difference]: With dead ends: 382 [2018-04-11 13:57:43,660 INFO L226 Difference]: Without dead ends: 382 [2018-04-11 13:57:43,660 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-11 13:57:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 254. [2018-04-11 13:57:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 13:57:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-04-11 13:57:43,665 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 469 [2018-04-11 13:57:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:43,665 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-04-11 13:57:43,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:57:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-04-11 13:57:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-04-11 13:57:43,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:43,667 INFO L355 BasicCegarLoop]: trace histogram [69, 56, 56, 56, 56, 56, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:43,667 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:43,668 INFO L82 PathProgramCache]: Analyzing trace with hash -677191454, now seen corresponding path program 29 times [2018-04-11 13:57:43,668 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:43,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11658 backedges. 1307 proven. 817 refuted. 0 times theorem prover too weak. 9534 trivial. 0 not checked. [2018-04-11 13:57:44,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:44,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:57:44,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 200 proven. 96 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-04-11 13:57:44,089 INFO L182 omatonBuilderFactory]: Interpolants [14816#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 14817#(<= main_~i~1 5), 14818#(<= main_~i~1 6), 14819#(<= main_~i~1 7), 14820#(<= main_~i~1 8), 14821#(<= main_~i~1 9), 14808#true, 14809#false, 14810#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 14811#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 14812#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 14813#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 14814#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 14815#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5))] [2018-04-11 13:57:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11658 backedges. 1307 proven. 817 refuted. 0 times theorem prover too weak. 9534 trivial. 0 not checked. [2018-04-11 13:57:44,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:57:44,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:57:44,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:44,090 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-04-11 13:57:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:44,284 INFO L93 Difference]: Finished difference Result 483 states and 670 transitions. [2018-04-11 13:57:44,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 13:57:44,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 511 [2018-04-11 13:57:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:44,312 INFO L225 Difference]: With dead ends: 483 [2018-04-11 13:57:44,312 INFO L226 Difference]: Without dead ends: 483 [2018-04-11 13:57:44,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:57:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-11 13:57:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 254. [2018-04-11 13:57:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 13:57:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-04-11 13:57:44,323 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 511 [2018-04-11 13:57:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:44,324 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-04-11 13:57:44,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:57:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-04-11 13:57:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-04-11 13:57:44,327 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:44,327 INFO L355 BasicCegarLoop]: trace histogram [70, 57, 57, 57, 57, 57, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:44,327 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2088382826, now seen corresponding path program 30 times [2018-04-11 13:57:44,328 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:44,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12020 backedges. 1708 proven. 720 refuted. 0 times theorem prover too weak. 9592 trivial. 0 not checked. [2018-04-11 13:57:44,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:44,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:57:44,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 229 proven. 76 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-04-11 13:57:44,833 INFO L182 omatonBuilderFactory]: Interpolants [15584#(<= main_~i~1 9), 15571#true, 15572#false, 15573#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 15574#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 15575#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 15576#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 15577#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 15578#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 15579#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 15580#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 15581#(<= main_~i~1 6), 15582#(<= main_~i~1 7), 15583#(<= main_~i~1 8)] [2018-04-11 13:57:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12020 backedges. 1708 proven. 720 refuted. 0 times theorem prover too weak. 9592 trivial. 0 not checked. [2018-04-11 13:57:44,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:57:44,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:57:44,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:44,834 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-04-11 13:57:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:45,083 INFO L93 Difference]: Finished difference Result 450 states and 618 transitions. [2018-04-11 13:57:45,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:57:45,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 517 [2018-04-11 13:57:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:45,086 INFO L225 Difference]: With dead ends: 450 [2018-04-11 13:57:45,087 INFO L226 Difference]: Without dead ends: 450 [2018-04-11 13:57:45,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:57:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-04-11 13:57:45,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 254. [2018-04-11 13:57:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 13:57:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-04-11 13:57:45,097 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 517 [2018-04-11 13:57:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:45,097 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-04-11 13:57:45,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:57:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-04-11 13:57:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-04-11 13:57:45,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:45,101 INFO L355 BasicCegarLoop]: trace histogram [71, 58, 58, 58, 58, 58, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:45,101 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1038597326, now seen corresponding path program 31 times [2018-04-11 13:57:45,102 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:45,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12388 backedges. 2217 proven. 515 refuted. 0 times theorem prover too weak. 9656 trivial. 0 not checked. [2018-04-11 13:57:45,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:45,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:57:45,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 273 proven. 44 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-04-11 13:57:45,564 INFO L182 omatonBuilderFactory]: Interpolants [16303#true, 16304#false, 16305#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 16306#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 16307#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 16308#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 16309#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 16310#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 16311#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 16312#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 16313#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 16314#(<= main_~i~1 7), 16315#(<= main_~i~1 8), 16316#(<= main_~i~1 9)] [2018-04-11 13:57:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12388 backedges. 2217 proven. 515 refuted. 0 times theorem prover too weak. 9656 trivial. 0 not checked. [2018-04-11 13:57:45,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:57:45,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:57:45,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:45,566 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-04-11 13:57:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:45,791 INFO L93 Difference]: Finished difference Result 409 states and 550 transitions. [2018-04-11 13:57:45,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:57:45,792 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 523 [2018-04-11 13:57:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:45,793 INFO L225 Difference]: With dead ends: 409 [2018-04-11 13:57:45,793 INFO L226 Difference]: Without dead ends: 409 [2018-04-11 13:57:45,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:57:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-04-11 13:57:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 254. [2018-04-11 13:57:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 13:57:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2018-04-11 13:57:45,805 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 523 [2018-04-11 13:57:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:45,806 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2018-04-11 13:57:45,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:57:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2018-04-11 13:57:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-04-11 13:57:45,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:45,810 INFO L355 BasicCegarLoop]: trace histogram [72, 59, 59, 59, 59, 59, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:45,810 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash 857384506, now seen corresponding path program 32 times [2018-04-11 13:57:45,811 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:45,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 2852 proven. 184 refuted. 0 times theorem prover too weak. 9726 trivial. 0 not checked. [2018-04-11 13:57:46,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:46,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:57:46,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2018-04-11 13:57:46,326 INFO L182 omatonBuilderFactory]: Interpolants [16996#true, 16997#false, 16998#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 16999#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 17000#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 17001#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 17002#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 17003#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 17004#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 17005#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 17006#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 17007#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 17008#(<= main_~i~1 8), 17009#(<= main_~i~1 9)] [2018-04-11 13:57:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12762 backedges. 2852 proven. 184 refuted. 0 times theorem prover too weak. 9726 trivial. 0 not checked. [2018-04-11 13:57:46,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:57:46,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:57:46,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:57:46,327 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand 14 states. [2018-04-11 13:57:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:46,527 INFO L93 Difference]: Finished difference Result 361 states and 487 transitions. [2018-04-11 13:57:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:57:46,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 529 [2018-04-11 13:57:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:46,529 INFO L225 Difference]: With dead ends: 361 [2018-04-11 13:57:46,529 INFO L226 Difference]: Without dead ends: 361 [2018-04-11 13:57:46,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:57:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-11 13:57:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 263. [2018-04-11 13:57:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 13:57:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2018-04-11 13:57:46,537 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 529 [2018-04-11 13:57:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:46,538 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2018-04-11 13:57:46,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:57:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2018-04-11 13:57:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-04-11 13:57:46,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:46,542 INFO L355 BasicCegarLoop]: trace histogram [73, 60, 60, 60, 60, 60, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:46,542 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1422482050, now seen corresponding path program 33 times [2018-04-11 13:57:46,543 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:46,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 13142 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 12648 trivial. 0 not checked. [2018-04-11 13:57:47,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:47,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:47,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2018-04-11 13:57:47,029 INFO L182 omatonBuilderFactory]: Interpolants [17664#(<= main_~i~1 10), 17665#(<= main_~i~1 11), 17666#(<= main_~i~1 12), 17667#(<= main_~i~1 13), 17652#true, 17653#false, 17654#(= main_~i~1 0), 17655#(<= main_~i~1 1), 17656#(<= main_~i~1 2), 17657#(<= main_~i~1 3), 17658#(<= main_~i~1 4), 17659#(<= main_~i~1 5), 17660#(<= main_~i~1 6), 17661#(<= main_~i~1 7), 17662#(<= main_~i~1 8), 17663#(<= main_~i~1 9)] [2018-04-11 13:57:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13142 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 12648 trivial. 0 not checked. [2018-04-11 13:57:47,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:47,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:47,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:47,030 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand 16 states. [2018-04-11 13:57:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:47,172 INFO L93 Difference]: Finished difference Result 439 states and 572 transitions. [2018-04-11 13:57:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:57:47,172 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 535 [2018-04-11 13:57:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:47,175 INFO L225 Difference]: With dead ends: 439 [2018-04-11 13:57:47,175 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 13:57:47,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 13:57:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 274. [2018-04-11 13:57:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 13:57:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-04-11 13:57:47,183 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 535 [2018-04-11 13:57:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:47,184 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-04-11 13:57:47,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-04-11 13:57:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-04-11 13:57:47,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:47,188 INFO L355 BasicCegarLoop]: trace histogram [79, 65, 65, 65, 65, 65, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:47,188 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash -688793877, now seen corresponding path program 34 times [2018-04-11 13:57:47,189 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:47,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15420 backedges. 1365 proven. 1142 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2018-04-11 13:57:47,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:47,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:57:47,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 200 proven. 128 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-11 13:57:47,656 INFO L182 omatonBuilderFactory]: Interpolants [18381#true, 18382#false, 18383#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 18384#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 18385#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 18386#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 18387#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 18388#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 18389#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 18390#(<= main_~i~1 5), 18391#(<= main_~i~1 6), 18392#(<= main_~i~1 7), 18393#(<= main_~i~1 8), 18394#(<= main_~i~1 9), 18395#(<= main_~i~1 10)] [2018-04-11 13:57:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15420 backedges. 1365 proven. 1142 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2018-04-11 13:57:47,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:57:47,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:57:47,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:47,657 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-04-11 13:57:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:47,888 INFO L93 Difference]: Finished difference Result 556 states and 830 transitions. [2018-04-11 13:57:47,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:57:47,888 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 577 [2018-04-11 13:57:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:47,890 INFO L225 Difference]: With dead ends: 556 [2018-04-11 13:57:47,890 INFO L226 Difference]: Without dead ends: 556 [2018-04-11 13:57:47,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:57:47,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-04-11 13:57:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 274. [2018-04-11 13:57:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 13:57:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-04-11 13:57:47,897 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 577 [2018-04-11 13:57:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:47,898 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-04-11 13:57:47,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:57:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-04-11 13:57:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-04-11 13:57:47,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:47,900 INFO L355 BasicCegarLoop]: trace histogram [80, 66, 66, 66, 66, 66, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:47,900 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1619073677, now seen corresponding path program 35 times [2018-04-11 13:57:47,901 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:47,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15838 backedges. 1772 proven. 1095 refuted. 0 times theorem prover too weak. 12971 trivial. 0 not checked. [2018-04-11 13:57:48,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:48,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:57:48,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 229 proven. 114 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-11 13:57:48,319 INFO L182 omatonBuilderFactory]: Interpolants [19238#true, 19239#false, 19240#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 19241#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 19242#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 19243#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 19244#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 19245#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 19246#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 19247#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 19248#(<= main_~i~1 6), 19249#(<= main_~i~1 7), 19250#(<= main_~i~1 8), 19251#(<= main_~i~1 9), 19252#(<= main_~i~1 10)] [2018-04-11 13:57:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15838 backedges. 1772 proven. 1095 refuted. 0 times theorem prover too weak. 12971 trivial. 0 not checked. [2018-04-11 13:57:48,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:57:48,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:57:48,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:48,320 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-04-11 13:57:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:48,513 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2018-04-11 13:57:48,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:57:48,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 583 [2018-04-11 13:57:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:48,517 INFO L225 Difference]: With dead ends: 529 [2018-04-11 13:57:48,517 INFO L226 Difference]: Without dead ends: 529 [2018-04-11 13:57:48,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:57:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-11 13:57:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 274. [2018-04-11 13:57:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 13:57:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-04-11 13:57:48,529 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 583 [2018-04-11 13:57:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:48,530 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-04-11 13:57:48,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:57:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-04-11 13:57:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-04-11 13:57:48,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:48,534 INFO L355 BasicCegarLoop]: trace histogram [81, 67, 67, 67, 67, 67, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:48,534 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1912773317, now seen corresponding path program 36 times [2018-04-11 13:57:48,535 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:48,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16262 backedges. 2287 proven. 940 refuted. 0 times theorem prover too weak. 13035 trivial. 0 not checked. [2018-04-11 13:57:49,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:49,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:57:49,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 273 proven. 88 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-11 13:57:49,079 INFO L182 omatonBuilderFactory]: Interpolants [20070#true, 20071#false, 20072#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 20073#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 20074#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 20075#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 20076#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 20077#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 20078#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 20079#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 20080#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 20081#(<= main_~i~1 7), 20082#(<= main_~i~1 8), 20083#(<= main_~i~1 9), 20084#(<= main_~i~1 10)] [2018-04-11 13:57:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16262 backedges. 2287 proven. 940 refuted. 0 times theorem prover too weak. 13035 trivial. 0 not checked. [2018-04-11 13:57:49,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:57:49,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:57:49,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:49,080 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-04-11 13:57:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:49,263 INFO L93 Difference]: Finished difference Result 490 states and 716 transitions. [2018-04-11 13:57:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:57:49,263 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 589 [2018-04-11 13:57:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:49,265 INFO L225 Difference]: With dead ends: 490 [2018-04-11 13:57:49,265 INFO L226 Difference]: Without dead ends: 490 [2018-04-11 13:57:49,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:57:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-04-11 13:57:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 274. [2018-04-11 13:57:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 13:57:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-04-11 13:57:49,275 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 589 [2018-04-11 13:57:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:49,275 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-04-11 13:57:49,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:57:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-04-11 13:57:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-04-11 13:57:49,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:49,280 INFO L355 BasicCegarLoop]: trace histogram [82, 68, 68, 68, 68, 68, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:49,280 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1734796867, now seen corresponding path program 37 times [2018-04-11 13:57:49,281 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:49,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16692 backedges. 2928 proven. 659 refuted. 0 times theorem prover too weak. 13105 trivial. 0 not checked. [2018-04-11 13:57:49,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:49,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:57:49,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 323 proven. 50 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-11 13:57:49,929 INFO L182 omatonBuilderFactory]: Interpolants [20865#true, 20866#false, 20867#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 20868#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 20869#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 20870#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 20871#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 20872#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 20873#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 20874#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 20875#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 20876#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 20877#(<= main_~i~1 8), 20878#(<= main_~i~1 9), 20879#(<= main_~i~1 10)] [2018-04-11 13:57:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16692 backedges. 2928 proven. 659 refuted. 0 times theorem prover too weak. 13105 trivial. 0 not checked. [2018-04-11 13:57:49,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:57:49,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:57:49,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:49,930 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-04-11 13:57:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:50,110 INFO L93 Difference]: Finished difference Result 443 states and 630 transitions. [2018-04-11 13:57:50,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:57:50,110 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 595 [2018-04-11 13:57:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:50,112 INFO L225 Difference]: With dead ends: 443 [2018-04-11 13:57:50,112 INFO L226 Difference]: Without dead ends: 443 [2018-04-11 13:57:50,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:57:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-11 13:57:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 274. [2018-04-11 13:57:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-11 13:57:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 355 transitions. [2018-04-11 13:57:50,117 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 355 transitions. Word has length 595 [2018-04-11 13:57:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:50,117 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 355 transitions. [2018-04-11 13:57:50,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:57:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 355 transitions. [2018-04-11 13:57:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-04-11 13:57:50,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:50,120 INFO L355 BasicCegarLoop]: trace histogram [83, 69, 69, 69, 69, 69, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:50,120 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1057187979, now seen corresponding path program 38 times [2018-04-11 13:57:50,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:50,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17128 backedges. 3713 proven. 234 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2018-04-11 13:57:50,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:50,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 13:57:50,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-11 13:57:50,526 INFO L182 omatonBuilderFactory]: Interpolants [21615#true, 21616#false, 21617#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 21618#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 21619#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 21620#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 21621#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 21622#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 21623#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 21624#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 21625#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 21626#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 21627#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 21628#(<= main_~i~1 9), 21629#(<= main_~i~1 10)] [2018-04-11 13:57:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17128 backedges. 3713 proven. 234 refuted. 0 times theorem prover too weak. 13181 trivial. 0 not checked. [2018-04-11 13:57:50,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:57:50,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:57:50,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:57:50,527 INFO L87 Difference]: Start difference. First operand 274 states and 355 transitions. Second operand 15 states. [2018-04-11 13:57:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:50,684 INFO L93 Difference]: Finished difference Result 389 states and 549 transitions. [2018-04-11 13:57:50,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:57:50,685 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 601 [2018-04-11 13:57:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:50,686 INFO L225 Difference]: With dead ends: 389 [2018-04-11 13:57:50,687 INFO L226 Difference]: Without dead ends: 389 [2018-04-11 13:57:50,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:57:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-11 13:57:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 283. [2018-04-11 13:57:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-11 13:57:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 376 transitions. [2018-04-11 13:57:50,692 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 376 transitions. Word has length 601 [2018-04-11 13:57:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:50,692 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 376 transitions. [2018-04-11 13:57:50,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:57:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 376 transitions. [2018-04-11 13:57:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-04-11 13:57:50,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:50,695 INFO L355 BasicCegarLoop]: trace histogram [84, 70, 70, 70, 70, 70, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:50,695 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash 141646867, now seen corresponding path program 39 times [2018-04-11 13:57:50,696 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:50,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17570 backedges. 990 proven. 1775 refuted. 0 times theorem prover too weak. 14805 trivial. 0 not checked. [2018-04-11 13:57:51,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:51,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:51,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 95 proven. 230 refuted. 0 times theorem prover too weak. 1619 trivial. 0 not checked. [2018-04-11 13:57:51,167 INFO L182 omatonBuilderFactory]: Interpolants [22336#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 22337#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 22322#true, 22323#false, 22324#(<= 0 main_~i~1), 22325#(<= 1 main_~i~1), 22326#(<= 2 main_~i~1), 22327#(<= 3 main_~i~1), 22328#(<= 4 main_~i~1), 22329#(<= 5 main_~i~1), 22330#(<= 6 main_~i~1), 22331#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 22332#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 22333#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 22334#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 22335#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4))] [2018-04-11 13:57:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17570 backedges. 990 proven. 1775 refuted. 0 times theorem prover too weak. 14805 trivial. 0 not checked. [2018-04-11 13:57:51,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:51,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:51,168 INFO L87 Difference]: Start difference. First operand 283 states and 376 transitions. Second operand 16 states. [2018-04-11 13:57:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:51,333 INFO L93 Difference]: Finished difference Result 313 states and 392 transitions. [2018-04-11 13:57:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:57:51,333 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 607 [2018-04-11 13:57:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:51,334 INFO L225 Difference]: With dead ends: 313 [2018-04-11 13:57:51,334 INFO L226 Difference]: Without dead ends: 313 [2018-04-11 13:57:51,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:57:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-11 13:57:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2018-04-11 13:57:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-11 13:57:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 368 transitions. [2018-04-11 13:57:51,337 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 368 transitions. Word has length 607 [2018-04-11 13:57:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:51,338 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 368 transitions. [2018-04-11 13:57:51,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 368 transitions. [2018-04-11 13:57:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-04-11 13:57:51,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:51,340 INFO L355 BasicCegarLoop]: trace histogram [87, 73, 73, 73, 73, 73, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:51,340 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1552314325, now seen corresponding path program 40 times [2018-04-11 13:57:51,341 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:51,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 18932 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 18358 trivial. 0 not checked. [2018-04-11 13:57:51,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:51,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:57:51,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2018-04-11 13:57:51,877 INFO L182 omatonBuilderFactory]: Interpolants [22946#true, 22947#false, 22948#(= main_~i~1 0), 22949#(<= main_~i~1 1), 22950#(<= main_~i~1 2), 22951#(<= main_~i~1 3), 22952#(<= main_~i~1 4), 22953#(<= main_~i~1 5), 22954#(<= main_~i~1 6), 22955#(<= main_~i~1 7), 22956#(<= main_~i~1 8), 22957#(<= main_~i~1 9), 22958#(<= main_~i~1 10), 22959#(<= main_~i~1 11), 22960#(<= main_~i~1 12), 22961#(<= main_~i~1 13), 22962#(<= main_~i~1 14)] [2018-04-11 13:57:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18932 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 18358 trivial. 0 not checked. [2018-04-11 13:57:51,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:57:51,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:57:51,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:57:51,878 INFO L87 Difference]: Start difference. First operand 283 states and 368 transitions. Second operand 17 states. [2018-04-11 13:57:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:51,992 INFO L93 Difference]: Finished difference Result 464 states and 606 transitions. [2018-04-11 13:57:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 13:57:51,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 625 [2018-04-11 13:57:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:51,995 INFO L225 Difference]: With dead ends: 464 [2018-04-11 13:57:51,995 INFO L226 Difference]: Without dead ends: 464 [2018-04-11 13:57:51,995 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:57:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-11 13:57:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 294. [2018-04-11 13:57:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-11 13:57:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-04-11 13:57:52,000 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 625 [2018-04-11 13:57:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:52,000 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-04-11 13:57:52,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:57:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-04-11 13:57:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2018-04-11 13:57:52,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:52,004 INFO L355 BasicCegarLoop]: trace histogram [94, 79, 79, 79, 79, 79, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:52,004 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash -971505124, now seen corresponding path program 41 times [2018-04-11 13:57:52,005 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:52,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 22146 backedges. 1950 proven. 1514 refuted. 0 times theorem prover too weak. 18682 trivial. 0 not checked. [2018-04-11 13:57:52,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:52,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:52,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2472 backedges. 256 proven. 152 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-04-11 13:57:52,568 INFO L182 omatonBuilderFactory]: Interpolants [23721#true, 23722#false, 23723#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 23724#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 23725#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 23726#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 23727#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 23728#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 23729#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 23730#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 23731#(<= main_~i~1 6), 23732#(<= main_~i~1 7), 23733#(<= main_~i~1 8), 23734#(<= main_~i~1 9), 23735#(<= main_~i~1 10), 23736#(<= main_~i~1 11)] [2018-04-11 13:57:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 22146 backedges. 1950 proven. 1514 refuted. 0 times theorem prover too weak. 18682 trivial. 0 not checked. [2018-04-11 13:57:52,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:52,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:52,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:52,569 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-04-11 13:57:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:52,756 INFO L93 Difference]: Finished difference Result 608 states and 923 transitions. [2018-04-11 13:57:52,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:57:52,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 673 [2018-04-11 13:57:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:52,758 INFO L225 Difference]: With dead ends: 608 [2018-04-11 13:57:52,758 INFO L226 Difference]: Without dead ends: 608 [2018-04-11 13:57:52,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:57:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-11 13:57:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 294. [2018-04-11 13:57:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-11 13:57:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-04-11 13:57:52,765 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 673 [2018-04-11 13:57:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:52,765 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-04-11 13:57:52,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-04-11 13:57:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-04-11 13:57:52,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:52,768 INFO L355 BasicCegarLoop]: trace histogram [95, 80, 80, 80, 80, 80, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:52,768 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2105112604, now seen corresponding path program 42 times [2018-04-11 13:57:52,769 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:52,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 2489 proven. 1415 refuted. 0 times theorem prover too weak. 18746 trivial. 0 not checked. [2018-04-11 13:57:53,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:53,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:53,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 291 proven. 132 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-04-11 13:57:53,312 INFO L182 omatonBuilderFactory]: Interpolants [24653#true, 24654#false, 24655#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 24656#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 24657#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 24658#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 24659#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 24660#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 24661#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 24662#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 24663#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 24664#(<= main_~i~1 7), 24665#(<= main_~i~1 8), 24666#(<= main_~i~1 9), 24667#(<= main_~i~1 10), 24668#(<= main_~i~1 11)] [2018-04-11 13:57:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 2489 proven. 1415 refuted. 0 times theorem prover too weak. 18746 trivial. 0 not checked. [2018-04-11 13:57:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:53,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:53,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:53,313 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-04-11 13:57:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:53,535 INFO L93 Difference]: Finished difference Result 575 states and 866 transitions. [2018-04-11 13:57:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:57:53,536 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 679 [2018-04-11 13:57:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:53,538 INFO L225 Difference]: With dead ends: 575 [2018-04-11 13:57:53,538 INFO L226 Difference]: Without dead ends: 575 [2018-04-11 13:57:53,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:57:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-11 13:57:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 294. [2018-04-11 13:57:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-11 13:57:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-04-11 13:57:53,546 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 679 [2018-04-11 13:57:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:53,546 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-04-11 13:57:53,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-04-11 13:57:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-04-11 13:57:53,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:53,551 INFO L355 BasicCegarLoop]: trace histogram [96, 81, 81, 81, 81, 81, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:53,551 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -887206164, now seen corresponding path program 43 times [2018-04-11 13:57:53,552 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:53,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23160 backedges. 3154 proven. 1190 refuted. 0 times theorem prover too weak. 18816 trivial. 0 not checked. [2018-04-11 13:57:54,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:54,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:54,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 341 proven. 100 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-04-11 13:57:54,073 INFO L182 omatonBuilderFactory]: Interpolants [25568#(<= main_~i~1 10), 25569#(<= main_~i~1 11), 25554#true, 25555#false, 25556#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 25557#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 25558#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 25559#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 25560#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 25561#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 25562#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 25563#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 25564#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 25565#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 25566#(<= main_~i~1 8), 25567#(<= main_~i~1 9)] [2018-04-11 13:57:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 23160 backedges. 3154 proven. 1190 refuted. 0 times theorem prover too weak. 18816 trivial. 0 not checked. [2018-04-11 13:57:54,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:54,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:54,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:54,074 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-04-11 13:57:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:54,291 INFO L93 Difference]: Finished difference Result 530 states and 787 transitions. [2018-04-11 13:57:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:57:54,292 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 685 [2018-04-11 13:57:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:54,294 INFO L225 Difference]: With dead ends: 530 [2018-04-11 13:57:54,294 INFO L226 Difference]: Without dead ends: 530 [2018-04-11 13:57:54,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:57:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-04-11 13:57:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 294. [2018-04-11 13:57:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-11 13:57:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-04-11 13:57:54,299 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 685 [2018-04-11 13:57:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:54,300 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-04-11 13:57:54,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-04-11 13:57:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-04-11 13:57:54,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:54,303 INFO L355 BasicCegarLoop]: trace histogram [97, 82, 82, 82, 82, 82, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:54,303 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1895344332, now seen corresponding path program 44 times [2018-04-11 13:57:54,303 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:54,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23676 backedges. 3963 proven. 821 refuted. 0 times theorem prover too weak. 18892 trivial. 0 not checked. [2018-04-11 13:57:54,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:54,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:54,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2517 backedges. 397 proven. 56 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-04-11 13:57:54,851 INFO L182 omatonBuilderFactory]: Interpolants [26412#true, 26413#false, 26414#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 26415#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 26416#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 26417#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 26418#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 26419#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 26420#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 26421#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 26422#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 26423#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 26424#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 26425#(<= main_~i~1 9), 26426#(<= main_~i~1 10), 26427#(<= main_~i~1 11)] [2018-04-11 13:57:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23676 backedges. 3963 proven. 821 refuted. 0 times theorem prover too weak. 18892 trivial. 0 not checked. [2018-04-11 13:57:54,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:54,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:54,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:54,852 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-04-11 13:57:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:55,050 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2018-04-11 13:57:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:57:55,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 691 [2018-04-11 13:57:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:55,052 INFO L225 Difference]: With dead ends: 477 [2018-04-11 13:57:55,052 INFO L226 Difference]: Without dead ends: 477 [2018-04-11 13:57:55,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:57:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-11 13:57:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 294. [2018-04-11 13:57:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-04-11 13:57:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2018-04-11 13:57:55,058 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 691 [2018-04-11 13:57:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:55,058 INFO L459 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2018-04-11 13:57:55,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2018-04-11 13:57:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2018-04-11 13:57:55,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:55,061 INFO L355 BasicCegarLoop]: trace histogram [98, 83, 83, 83, 83, 83, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:55,061 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash 80744636, now seen corresponding path program 45 times [2018-04-11 13:57:55,062 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:55,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 4934 proven. 290 refuted. 0 times theorem prover too weak. 18974 trivial. 0 not checked. [2018-04-11 13:57:55,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:55,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:57:55,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 2064 trivial. 0 not checked. [2018-04-11 13:57:55,626 INFO L182 omatonBuilderFactory]: Interpolants [27232#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 27233#(<= main_~i~1 10), 27234#(<= main_~i~1 11), 27219#true, 27220#false, 27221#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 27222#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 27223#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 27224#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 27225#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 27226#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 27227#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 27228#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 27229#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 27230#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 27231#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10))] [2018-04-11 13:57:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24198 backedges. 4934 proven. 290 refuted. 0 times theorem prover too weak. 18974 trivial. 0 not checked. [2018-04-11 13:57:55,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:57:55,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:57:55,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:57:55,627 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand 16 states. [2018-04-11 13:57:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:55,834 INFO L93 Difference]: Finished difference Result 417 states and 597 transitions. [2018-04-11 13:57:55,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 13:57:55,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 697 [2018-04-11 13:57:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:55,836 INFO L225 Difference]: With dead ends: 417 [2018-04-11 13:57:55,836 INFO L226 Difference]: Without dead ends: 417 [2018-04-11 13:57:55,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:57:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-11 13:57:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 303. [2018-04-11 13:57:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-11 13:57:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 407 transitions. [2018-04-11 13:57:55,839 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 407 transitions. Word has length 697 [2018-04-11 13:57:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:55,840 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 407 transitions. [2018-04-11 13:57:55,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:57:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 407 transitions. [2018-04-11 13:57:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2018-04-11 13:57:55,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:55,843 INFO L355 BasicCegarLoop]: trace histogram [99, 84, 84, 84, 84, 84, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:55,843 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2083609476, now seen corresponding path program 46 times [2018-04-11 13:57:55,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:55,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24726 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 24066 trivial. 0 not checked. [2018-04-11 13:57:56,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:56,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:57:56,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-11 13:57:56,415 INFO L182 omatonBuilderFactory]: Interpolants [27977#true, 27978#false, 27979#(= main_~i~1 0), 27980#(<= main_~i~1 1), 27981#(<= main_~i~1 2), 27982#(<= main_~i~1 3), 27983#(<= main_~i~1 4), 27984#(<= main_~i~1 5), 27985#(<= main_~i~1 6), 27986#(<= main_~i~1 7), 27987#(<= main_~i~1 8), 27988#(<= main_~i~1 9), 27989#(<= main_~i~1 10), 27990#(<= main_~i~1 11), 27991#(<= main_~i~1 12), 27992#(<= main_~i~1 13), 27993#(<= main_~i~1 14), 27994#(<= main_~i~1 15)] [2018-04-11 13:57:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 24726 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 24066 trivial. 0 not checked. [2018-04-11 13:57:56,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:57:56,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:57:56,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:57:56,416 INFO L87 Difference]: Start difference. First operand 303 states and 407 transitions. Second operand 18 states. [2018-04-11 13:57:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:56,631 INFO L93 Difference]: Finished difference Result 527 states and 737 transitions. [2018-04-11 13:57:56,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:57:56,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 703 [2018-04-11 13:57:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:56,653 INFO L225 Difference]: With dead ends: 527 [2018-04-11 13:57:56,653 INFO L226 Difference]: Without dead ends: 527 [2018-04-11 13:57:56,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:57:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-04-11 13:57:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 314. [2018-04-11 13:57:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 13:57:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 425 transitions. [2018-04-11 13:57:56,663 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 425 transitions. Word has length 703 [2018-04-11 13:57:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:56,663 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 425 transitions. [2018-04-11 13:57:56,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:57:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 425 transitions. [2018-04-11 13:57:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-04-11 13:57:56,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:56,669 INFO L355 BasicCegarLoop]: trace histogram [106, 90, 90, 90, 90, 90, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:56,669 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1951724619, now seen corresponding path program 47 times [2018-04-11 13:57:56,670 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:56,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28382 backedges. 1469 proven. 2632 refuted. 0 times theorem prover too weak. 24281 trivial. 0 not checked. [2018-04-11 13:57:57,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:57,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:57:57,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 133 proven. 313 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2018-04-11 13:57:57,413 INFO L182 omatonBuilderFactory]: Interpolants [28836#true, 28837#false, 28838#(<= 0 main_~i~1), 28839#(<= 1 main_~i~1), 28840#(<= 2 main_~i~1), 28841#(<= 3 main_~i~1), 28842#(<= 4 main_~i~1), 28843#(<= 5 main_~i~1), 28844#(<= 6 main_~i~1), 28845#(<= 7 main_~i~1), 28846#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 28847#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 28848#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 28849#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 28850#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 28851#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 28852#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 28853#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6)] [2018-04-11 13:57:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 28382 backedges. 1469 proven. 2632 refuted. 0 times theorem prover too weak. 24281 trivial. 0 not checked. [2018-04-11 13:57:57,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:57:57,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:57:57,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:57:57,414 INFO L87 Difference]: Start difference. First operand 314 states and 425 transitions. Second operand 18 states. [2018-04-11 13:57:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:57,718 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2018-04-11 13:57:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:57:57,718 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 751 [2018-04-11 13:57:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:57,720 INFO L225 Difference]: With dead ends: 349 [2018-04-11 13:57:57,720 INFO L226 Difference]: Without dead ends: 349 [2018-04-11 13:57:57,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:57:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-11 13:57:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2018-04-11 13:57:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 13:57:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 416 transitions. [2018-04-11 13:57:57,723 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 416 transitions. Word has length 751 [2018-04-11 13:57:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:57,723 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 416 transitions. [2018-04-11 13:57:57,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:57:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 416 transitions. [2018-04-11 13:57:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-04-11 13:57:57,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:57,726 INFO L355 BasicCegarLoop]: trace histogram [110, 94, 94, 94, 94, 94, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:57,727 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -234595499, now seen corresponding path program 48 times [2018-04-11 13:57:57,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:57,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30706 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 29954 trivial. 0 not checked. [2018-04-11 13:57:58,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:58,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:57:58,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-04-11 13:57:58,386 INFO L182 omatonBuilderFactory]: Interpolants [29536#(<= main_~i~1 3), 29537#(<= main_~i~1 4), 29538#(<= main_~i~1 5), 29539#(<= main_~i~1 6), 29540#(<= main_~i~1 7), 29541#(<= main_~i~1 8), 29542#(<= main_~i~1 9), 29543#(<= main_~i~1 10), 29544#(<= main_~i~1 11), 29545#(<= main_~i~1 12), 29546#(<= main_~i~1 13), 29547#(<= main_~i~1 14), 29548#(<= main_~i~1 15), 29549#(<= main_~i~1 16), 29531#true, 29532#false, 29533#(= main_~i~1 0), 29534#(<= main_~i~1 1), 29535#(<= main_~i~1 2)] [2018-04-11 13:57:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 30706 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 29954 trivial. 0 not checked. [2018-04-11 13:57:58,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:57:58,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:57:58,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:57:58,387 INFO L87 Difference]: Start difference. First operand 314 states and 416 transitions. Second operand 19 states. [2018-04-11 13:57:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:58,513 INFO L93 Difference]: Finished difference Result 505 states and 662 transitions. [2018-04-11 13:57:58,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 13:57:58,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 775 [2018-04-11 13:57:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:58,515 INFO L225 Difference]: With dead ends: 505 [2018-04-11 13:57:58,515 INFO L226 Difference]: Without dead ends: 505 [2018-04-11 13:57:58,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:57:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-04-11 13:57:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 325. [2018-04-11 13:57:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-11 13:57:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-04-11 13:57:58,521 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 775 [2018-04-11 13:57:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:58,522 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-04-11 13:57:58,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:57:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-04-11 13:57:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2018-04-11 13:57:58,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:58,526 INFO L355 BasicCegarLoop]: trace histogram [118, 101, 101, 101, 101, 101, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:58,526 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1205015410, now seen corresponding path program 49 times [2018-04-11 13:57:58,527 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:58,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:57:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 35400 backedges. 6618 proven. 352 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-04-11 13:57:59,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:57:59,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:57:59,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:57:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2018-04-11 13:57:59,333 INFO L182 omatonBuilderFactory]: Interpolants [30380#true, 30381#false, 30382#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 30383#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 30384#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 30385#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 30386#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 30387#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 30388#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 30389#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 30390#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 30391#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 30392#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 30393#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 30394#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 30395#(<= main_~i~1 11), 30396#(<= main_~i~1 12)] [2018-04-11 13:57:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 35400 backedges. 6618 proven. 352 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-04-11 13:57:59,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:57:59,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:57:59,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:57:59,334 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 17 states. [2018-04-11 13:57:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:57:59,562 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2018-04-11 13:57:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:57:59,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 829 [2018-04-11 13:57:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:57:59,564 INFO L225 Difference]: With dead ends: 464 [2018-04-11 13:57:59,564 INFO L226 Difference]: Without dead ends: 464 [2018-04-11 13:57:59,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:57:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-11 13:57:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 331. [2018-04-11 13:57:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-04-11 13:57:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 440 transitions. [2018-04-11 13:57:59,568 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 440 transitions. Word has length 829 [2018-04-11 13:57:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:57:59,569 INFO L459 AbstractCegarLoop]: Abstraction has 331 states and 440 transitions. [2018-04-11 13:57:59,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:57:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 440 transitions. [2018-04-11 13:57:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-04-11 13:57:59,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:57:59,573 INFO L355 BasicCegarLoop]: trace histogram [119, 102, 102, 102, 102, 102, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:57:59,573 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:57:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1810198058, now seen corresponding path program 50 times [2018-04-11 13:57:59,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:57:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:57:59,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 7190 proven. 420 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-04-11 13:58:00,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:00,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:58:00,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2018-04-11 13:58:00,384 INFO L182 omatonBuilderFactory]: Interpolants [31232#(<= main_~i~1 12), 31233#(<= main_~i~1 13), 31216#true, 31217#false, 31218#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 31219#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 31220#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 31221#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 31222#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 31223#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 31224#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 31225#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 31226#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 31227#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 31228#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 31229#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 31230#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 31231#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12)] [2018-04-11 13:58:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 7190 proven. 420 refuted. 0 times theorem prover too weak. 28430 trivial. 0 not checked. [2018-04-11 13:58:00,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:58:00,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:58:00,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:58:00,385 INFO L87 Difference]: Start difference. First operand 331 states and 440 transitions. Second operand 18 states. [2018-04-11 13:58:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:00,641 INFO L93 Difference]: Finished difference Result 473 states and 717 transitions. [2018-04-11 13:58:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:58:00,641 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 835 [2018-04-11 13:58:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:00,643 INFO L225 Difference]: With dead ends: 473 [2018-04-11 13:58:00,643 INFO L226 Difference]: Without dead ends: 473 [2018-04-11 13:58:00,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:58:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-04-11 13:58:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 337. [2018-04-11 13:58:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-11 13:58:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2018-04-11 13:58:00,650 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 835 [2018-04-11 13:58:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:00,651 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2018-04-11 13:58:00,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:58:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2018-04-11 13:58:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-04-11 13:58:00,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:00,658 INFO L355 BasicCegarLoop]: trace histogram [120, 103, 103, 103, 103, 103, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:00,658 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1329144094, now seen corresponding path program 51 times [2018-04-11 13:58:00,659 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:00,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36686 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 35836 trivial. 0 not checked. [2018-04-11 13:58:01,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:01,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:01,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3690 trivial. 0 not checked. [2018-04-11 13:58:01,498 INFO L182 omatonBuilderFactory]: Interpolants [32070#true, 32071#false, 32072#(= main_~i~1 0), 32073#(<= main_~i~1 1), 32074#(<= main_~i~1 2), 32075#(<= main_~i~1 3), 32076#(<= main_~i~1 4), 32077#(<= main_~i~1 5), 32078#(<= main_~i~1 6), 32079#(<= main_~i~1 7), 32080#(<= main_~i~1 8), 32081#(<= main_~i~1 9), 32082#(<= main_~i~1 10), 32083#(<= main_~i~1 11), 32084#(<= main_~i~1 12), 32085#(<= main_~i~1 13), 32086#(<= main_~i~1 14), 32087#(<= main_~i~1 15), 32088#(<= main_~i~1 16), 32089#(<= main_~i~1 17)] [2018-04-11 13:58:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36686 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 35836 trivial. 0 not checked. [2018-04-11 13:58:01,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:01,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:01,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:01,499 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand 20 states. [2018-04-11 13:58:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:01,683 INFO L93 Difference]: Finished difference Result 533 states and 697 transitions. [2018-04-11 13:58:01,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 13:58:01,715 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 841 [2018-04-11 13:58:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:01,717 INFO L225 Difference]: With dead ends: 533 [2018-04-11 13:58:01,717 INFO L226 Difference]: Without dead ends: 533 [2018-04-11 13:58:01,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-11 13:58:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 348. [2018-04-11 13:58:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-11 13:58:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-04-11 13:58:01,721 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 841 [2018-04-11 13:58:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:01,722 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-04-11 13:58:01,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-04-11 13:58:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2018-04-11 13:58:01,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:01,728 INFO L355 BasicCegarLoop]: trace histogram [128, 110, 110, 110, 110, 110, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:01,728 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1888354327, now seen corresponding path program 52 times [2018-04-11 13:58:01,728 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:01,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 41802 backedges. 5960 proven. 1125 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-04-11 13:58:02,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:02,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:58:02,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 544 proven. 62 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-04-11 13:58:02,657 INFO L182 omatonBuilderFactory]: Interpolants [32971#true, 32972#false, 32973#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 32974#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 32975#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 32976#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 32977#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 32978#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 32979#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 32980#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 32981#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 32982#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 32983#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 32984#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 32985#(<= main_~i~1 10), 32986#(<= main_~i~1 11), 32987#(<= main_~i~1 12)] [2018-04-11 13:58:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 41802 backedges. 5960 proven. 1125 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-04-11 13:58:02,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:58:02,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:58:02,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:58:02,659 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 17 states. [2018-04-11 13:58:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:02,905 INFO L93 Difference]: Finished difference Result 572 states and 890 transitions. [2018-04-11 13:58:02,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:58:02,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 895 [2018-04-11 13:58:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:02,907 INFO L225 Difference]: With dead ends: 572 [2018-04-11 13:58:02,908 INFO L226 Difference]: Without dead ends: 572 [2018-04-11 13:58:02,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:58:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-04-11 13:58:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 348. [2018-04-11 13:58:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-11 13:58:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-04-11 13:58:02,914 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 895 [2018-04-11 13:58:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:02,914 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-04-11 13:58:02,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:58:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-04-11 13:58:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 902 [2018-04-11 13:58:02,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:02,918 INFO L355 BasicCegarLoop]: trace histogram [129, 111, 111, 111, 111, 111, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:02,919 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 904827743, now seen corresponding path program 53 times [2018-04-11 13:58:02,919 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:02,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 42498 backedges. 6514 proven. 1267 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-04-11 13:58:03,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:03,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:58:03,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 544 proven. 68 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-04-11 13:58:03,840 INFO L182 omatonBuilderFactory]: Interpolants [33930#true, 33931#false, 33932#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 33933#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 33934#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 33935#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 33936#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 33937#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 33938#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 33939#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 33940#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 33941#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 33942#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 33943#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 33944#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 33945#(<= main_~i~1 11), 33946#(<= main_~i~1 12), 33947#(<= main_~i~1 13)] [2018-04-11 13:58:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 42498 backedges. 6514 proven. 1267 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-04-11 13:58:03,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:58:03,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:58:03,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:58:03,842 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 18 states. [2018-04-11 13:58:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:04,081 INFO L93 Difference]: Finished difference Result 575 states and 937 transitions. [2018-04-11 13:58:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:58:04,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 901 [2018-04-11 13:58:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:04,084 INFO L225 Difference]: With dead ends: 575 [2018-04-11 13:58:04,084 INFO L226 Difference]: Without dead ends: 575 [2018-04-11 13:58:04,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=282, Invalid=588, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:58:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-11 13:58:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 348. [2018-04-11 13:58:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-11 13:58:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2018-04-11 13:58:04,092 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 901 [2018-04-11 13:58:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:04,093 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2018-04-11 13:58:04,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:58:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2018-04-11 13:58:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2018-04-11 13:58:04,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:04,098 INFO L355 BasicCegarLoop]: trace histogram [130, 112, 112, 112, 112, 112, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:04,098 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2011852633, now seen corresponding path program 54 times [2018-04-11 13:58:04,098 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:04,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 43200 backedges. 7068 proven. 1415 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-04-11 13:58:05,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:05,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:58:05,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 544 proven. 74 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-04-11 13:58:05,110 INFO L182 omatonBuilderFactory]: Interpolants [34912#(<= main_~i~1 13), 34913#(<= main_~i~1 14), 34895#true, 34896#false, 34897#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 34898#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 34899#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 34900#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 34901#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 34902#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 34903#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 34904#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 34905#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 34906#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 34907#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 34908#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 34909#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 34910#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 34911#(<= main_~i~1 12)] [2018-04-11 13:58:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43200 backedges. 7068 proven. 1415 refuted. 0 times theorem prover too weak. 34717 trivial. 0 not checked. [2018-04-11 13:58:05,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:58:05,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:58:05,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:58:05,111 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand 19 states. [2018-04-11 13:58:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:05,356 INFO L93 Difference]: Finished difference Result 579 states and 941 transitions. [2018-04-11 13:58:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:58:05,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 907 [2018-04-11 13:58:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:05,359 INFO L225 Difference]: With dead ends: 579 [2018-04-11 13:58:05,359 INFO L226 Difference]: Without dead ends: 579 [2018-04-11 13:58:05,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=324, Invalid=668, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:58:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-04-11 13:58:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 345. [2018-04-11 13:58:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-11 13:58:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 446 transitions. [2018-04-11 13:58:05,365 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 446 transitions. Word has length 907 [2018-04-11 13:58:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:05,365 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 446 transitions. [2018-04-11 13:58:05,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:58:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 446 transitions. [2018-04-11 13:58:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2018-04-11 13:58:05,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:05,370 INFO L355 BasicCegarLoop]: trace histogram [131, 113, 113, 113, 113, 113, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:05,370 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1895073809, now seen corresponding path program 55 times [2018-04-11 13:58:05,371 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:05,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 8597 proven. 494 refuted. 0 times theorem prover too weak. 34817 trivial. 0 not checked. [2018-04-11 13:58:06,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:06,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:58:06,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-04-11 13:58:06,354 INFO L182 omatonBuilderFactory]: Interpolants [35872#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 35873#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 35874#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 35875#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 35876#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 35877#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 35878#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 35879#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 35880#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13), 35881#(<= main_~i~1 13), 35882#(<= main_~i~1 14), 35864#true, 35865#false, 35866#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 35867#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 35868#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 35869#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 35870#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 35871#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5))] [2018-04-11 13:58:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 43908 backedges. 8597 proven. 494 refuted. 0 times theorem prover too weak. 34817 trivial. 0 not checked. [2018-04-11 13:58:06,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:58:06,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:58:06,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:58:06,356 INFO L87 Difference]: Start difference. First operand 345 states and 446 transitions. Second operand 19 states. [2018-04-11 13:58:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:06,601 INFO L93 Difference]: Finished difference Result 501 states and 791 transitions. [2018-04-11 13:58:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:58:06,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 913 [2018-04-11 13:58:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:06,604 INFO L225 Difference]: With dead ends: 501 [2018-04-11 13:58:06,604 INFO L226 Difference]: Without dead ends: 501 [2018-04-11 13:58:06,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:58:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-11 13:58:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 354. [2018-04-11 13:58:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-11 13:58:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-04-11 13:58:06,610 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 913 [2018-04-11 13:58:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:06,610 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-04-11 13:58:06,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:58:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-04-11 13:58:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-04-11 13:58:06,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:06,615 INFO L355 BasicCegarLoop]: trace histogram [132, 114, 114, 114, 114, 114, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:06,615 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1507938423, now seen corresponding path program 56 times [2018-04-11 13:58:06,616 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:06,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44622 backedges. 2086 proven. 3787 refuted. 0 times theorem prover too weak. 38749 trivial. 0 not checked. [2018-04-11 13:58:07,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:07,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:07,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4311 backedges. 177 proven. 411 refuted. 0 times theorem prover too weak. 3723 trivial. 0 not checked. [2018-04-11 13:58:07,637 INFO L182 omatonBuilderFactory]: Interpolants [36768#(<= 0 main_~i~1), 36769#(<= 1 main_~i~1), 36770#(<= 2 main_~i~1), 36771#(<= 3 main_~i~1), 36772#(<= 4 main_~i~1), 36773#(<= 5 main_~i~1), 36774#(<= 6 main_~i~1), 36775#(<= 7 main_~i~1), 36776#(<= 8 main_~i~1), 36777#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 36778#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 36779#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 36780#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 36781#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 36782#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 36783#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 36784#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 36785#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 36766#true, 36767#false] [2018-04-11 13:58:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 44622 backedges. 2086 proven. 3787 refuted. 0 times theorem prover too weak. 38749 trivial. 0 not checked. [2018-04-11 13:58:07,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:07,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:07,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:07,639 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 20 states. [2018-04-11 13:58:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:08,014 INFO L93 Difference]: Finished difference Result 394 states and 493 transitions. [2018-04-11 13:58:08,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 13:58:08,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 919 [2018-04-11 13:58:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:08,015 INFO L225 Difference]: With dead ends: 394 [2018-04-11 13:58:08,015 INFO L226 Difference]: Without dead ends: 394 [2018-04-11 13:58:08,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:58:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-11 13:58:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 354. [2018-04-11 13:58:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-11 13:58:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 461 transitions. [2018-04-11 13:58:08,019 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 461 transitions. Word has length 919 [2018-04-11 13:58:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:08,020 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 461 transitions. [2018-04-11 13:58:08,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2018-04-11 13:58:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2018-04-11 13:58:08,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:08,025 INFO L355 BasicCegarLoop]: trace histogram [138, 120, 120, 120, 120, 120, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:08,025 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1331307801, now seen corresponding path program 57 times [2018-04-11 13:58:08,025 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:08,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 49032 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 48078 trivial. 0 not checked. [2018-04-11 13:58:09,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:09,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:58:09,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4545 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4545 trivial. 0 not checked. [2018-04-11 13:58:09,100 INFO L182 omatonBuilderFactory]: Interpolants [37568#(<= main_~i~1 16), 37569#(<= main_~i~1 17), 37570#(<= main_~i~1 18), 37550#true, 37551#false, 37552#(= main_~i~1 0), 37553#(<= main_~i~1 1), 37554#(<= main_~i~1 2), 37555#(<= main_~i~1 3), 37556#(<= main_~i~1 4), 37557#(<= main_~i~1 5), 37558#(<= main_~i~1 6), 37559#(<= main_~i~1 7), 37560#(<= main_~i~1 8), 37561#(<= main_~i~1 9), 37562#(<= main_~i~1 10), 37563#(<= main_~i~1 11), 37564#(<= main_~i~1 12), 37565#(<= main_~i~1 13), 37566#(<= main_~i~1 14), 37567#(<= main_~i~1 15)] [2018-04-11 13:58:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 49032 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 48078 trivial. 0 not checked. [2018-04-11 13:58:09,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:58:09,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:58:09,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:09,101 INFO L87 Difference]: Start difference. First operand 354 states and 461 transitions. Second operand 21 states. [2018-04-11 13:58:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:09,255 INFO L93 Difference]: Finished difference Result 523 states and 649 transitions. [2018-04-11 13:58:09,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:58:09,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 955 [2018-04-11 13:58:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:09,257 INFO L225 Difference]: With dead ends: 523 [2018-04-11 13:58:09,257 INFO L226 Difference]: Without dead ends: 523 [2018-04-11 13:58:09,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-04-11 13:58:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 365. [2018-04-11 13:58:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-11 13:58:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-04-11 13:58:09,262 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 955 [2018-04-11 13:58:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:09,262 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-04-11 13:58:09,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:58:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-04-11 13:58:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-04-11 13:58:09,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:09,268 INFO L355 BasicCegarLoop]: trace histogram [147, 128, 128, 128, 128, 128, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:09,268 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1086056216, now seen corresponding path program 58 times [2018-04-11 13:58:09,268 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:09,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 55722 backedges. 5786 proven. 1806 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:10,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:10,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:58:10,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 574 proven. 112 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-04-11 13:58:10,343 INFO L182 omatonBuilderFactory]: Interpolants [38464#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 38465#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 38466#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 38467#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 38468#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 38469#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 38470#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 38471#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 38472#(<= main_~i~1 9), 38473#(<= main_~i~1 10), 38474#(<= main_~i~1 11), 38475#(<= main_~i~1 12), 38459#true, 38460#false, 38461#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 38462#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 38463#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2))] [2018-04-11 13:58:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 55722 backedges. 5786 proven. 1806 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:10,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:58:10,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:58:10,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:58:10,345 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 17 states. [2018-04-11 13:58:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:10,535 INFO L93 Difference]: Finished difference Result 684 states and 1059 transitions. [2018-04-11 13:58:10,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 13:58:10,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1015 [2018-04-11 13:58:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:10,538 INFO L225 Difference]: With dead ends: 684 [2018-04-11 13:58:10,539 INFO L226 Difference]: Without dead ends: 684 [2018-04-11 13:58:10,539 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:58:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-04-11 13:58:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 365. [2018-04-11 13:58:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-11 13:58:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-04-11 13:58:10,546 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1015 [2018-04-11 13:58:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:10,546 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-04-11 13:58:10,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:58:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-04-11 13:58:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2018-04-11 13:58:10,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:10,551 INFO L355 BasicCegarLoop]: trace histogram [148, 129, 129, 129, 129, 129, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:10,552 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash -616958928, now seen corresponding path program 59 times [2018-04-11 13:58:10,552 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:10,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 56528 backedges. 6370 proven. 2028 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:11,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:11,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:58:11,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 574 proven. 124 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-04-11 13:58:11,642 INFO L182 omatonBuilderFactory]: Interpolants [39552#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 39553#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 39554#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 39555#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 39556#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 39557#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 39558#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 39559#(<= main_~i~1 10), 39560#(<= main_~i~1 11), 39561#(<= main_~i~1 12), 39562#(<= main_~i~1 13), 39545#true, 39546#false, 39547#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 39548#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 39549#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 39550#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 39551#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4))] [2018-04-11 13:58:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 56528 backedges. 6370 proven. 2028 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:11,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:58:11,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:58:11,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:58:11,643 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 18 states. [2018-04-11 13:58:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:11,873 INFO L93 Difference]: Finished difference Result 687 states and 1122 transitions. [2018-04-11 13:58:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:58:11,873 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1021 [2018-04-11 13:58:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:11,877 INFO L225 Difference]: With dead ends: 687 [2018-04-11 13:58:11,877 INFO L226 Difference]: Without dead ends: 687 [2018-04-11 13:58:11,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:58:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-11 13:58:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 365. [2018-04-11 13:58:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-11 13:58:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-04-11 13:58:11,885 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1021 [2018-04-11 13:58:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:11,885 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-04-11 13:58:11,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:58:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-04-11 13:58:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2018-04-11 13:58:11,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:11,891 INFO L355 BasicCegarLoop]: trace histogram [149, 130, 130, 130, 130, 130, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:11,891 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1088436600, now seen corresponding path program 60 times [2018-04-11 13:58:11,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:11,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 57340 backedges. 6954 proven. 2256 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:13,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:13,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:58:13,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5280 backedges. 574 proven. 136 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-04-11 13:58:13,054 INFO L182 omatonBuilderFactory]: Interpolants [40640#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 40641#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 40642#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 40643#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 40644#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 40645#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 40646#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 40647#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 40648#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 40649#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 40650#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 40651#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 40652#(<= main_~i~1 11), 40653#(<= main_~i~1 12), 40654#(<= main_~i~1 13), 40655#(<= main_~i~1 14), 40637#true, 40638#false, 40639#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0))] [2018-04-11 13:58:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 57340 backedges. 6954 proven. 2256 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:13,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:58:13,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:58:13,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:58:13,055 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 19 states. [2018-04-11 13:58:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:13,287 INFO L93 Difference]: Finished difference Result 690 states and 1185 transitions. [2018-04-11 13:58:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:58:13,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1027 [2018-04-11 13:58:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:13,291 INFO L225 Difference]: With dead ends: 690 [2018-04-11 13:58:13,291 INFO L226 Difference]: Without dead ends: 690 [2018-04-11 13:58:13,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:58:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-04-11 13:58:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 365. [2018-04-11 13:58:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-11 13:58:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 477 transitions. [2018-04-11 13:58:13,300 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 477 transitions. Word has length 1027 [2018-04-11 13:58:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:13,300 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 477 transitions. [2018-04-11 13:58:13,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:58:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 477 transitions. [2018-04-11 13:58:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2018-04-11 13:58:13,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:13,306 INFO L355 BasicCegarLoop]: trace histogram [150, 131, 131, 131, 131, 131, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:13,306 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1086286016, now seen corresponding path program 61 times [2018-04-11 13:58:13,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:13,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 58158 backedges. 7538 proven. 2490 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:14,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:14,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:14,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 574 proven. 148 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-04-11 13:58:14,523 INFO L182 omatonBuilderFactory]: Interpolants [41735#true, 41736#false, 41737#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 41738#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 41739#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 41740#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 41741#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 41742#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 41743#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 41744#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 41745#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 41746#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 41747#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 41748#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 41749#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 41750#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 41751#(<= main_~i~1 12), 41752#(<= main_~i~1 13), 41753#(<= main_~i~1 14), 41754#(<= main_~i~1 15)] [2018-04-11 13:58:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 58158 backedges. 7538 proven. 2490 refuted. 0 times theorem prover too weak. 48130 trivial. 0 not checked. [2018-04-11 13:58:14,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:14,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:14,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:14,524 INFO L87 Difference]: Start difference. First operand 365 states and 477 transitions. Second operand 20 states. [2018-04-11 13:58:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:14,784 INFO L93 Difference]: Finished difference Result 690 states and 1185 transitions. [2018-04-11 13:58:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:58:14,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1033 [2018-04-11 13:58:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:14,790 INFO L225 Difference]: With dead ends: 690 [2018-04-11 13:58:14,790 INFO L226 Difference]: Without dead ends: 690 [2018-04-11 13:58:14,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:58:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-04-11 13:58:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 362. [2018-04-11 13:58:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-11 13:58:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2018-04-11 13:58:14,800 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 1033 [2018-04-11 13:58:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:14,800 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2018-04-11 13:58:14,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2018-04-11 13:58:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-04-11 13:58:14,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:14,806 INFO L355 BasicCegarLoop]: trace histogram [151, 132, 132, 132, 132, 132, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:14,806 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1023409656, now seen corresponding path program 62 times [2018-04-11 13:58:14,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:14,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 58982 backedges. 9103 proven. 1649 refuted. 0 times theorem prover too weak. 48230 trivial. 0 not checked. [2018-04-11 13:58:16,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:16,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:16,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5307 backedges. 657 proven. 80 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-04-11 13:58:16,037 INFO L182 omatonBuilderFactory]: Interpolants [42848#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 42849#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13), 42850#(<= main_~i~1 13), 42851#(<= main_~i~1 14), 42852#(<= main_~i~1 15), 42833#true, 42834#false, 42835#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 42836#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 42837#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 42838#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 42839#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 42840#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 42841#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 42842#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 42843#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 42844#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 42845#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 42846#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 42847#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12))] [2018-04-11 13:58:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 58982 backedges. 9103 proven. 1649 refuted. 0 times theorem prover too weak. 48230 trivial. 0 not checked. [2018-04-11 13:58:16,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:16,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:16,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:16,039 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand 20 states. [2018-04-11 13:58:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:16,269 INFO L93 Difference]: Finished difference Result 613 states and 1012 transitions. [2018-04-11 13:58:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:58:16,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1039 [2018-04-11 13:58:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:16,273 INFO L225 Difference]: With dead ends: 613 [2018-04-11 13:58:16,273 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 13:58:16,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:58:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 13:58:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 362. [2018-04-11 13:58:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-11 13:58:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 458 transitions. [2018-04-11 13:58:16,281 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 458 transitions. Word has length 1039 [2018-04-11 13:58:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:16,282 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 458 transitions. [2018-04-11 13:58:16,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 458 transitions. [2018-04-11 13:58:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2018-04-11 13:58:16,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:16,287 INFO L355 BasicCegarLoop]: trace histogram [152, 133, 133, 133, 133, 133, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:16,287 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1458828144, now seen corresponding path program 63 times [2018-04-11 13:58:16,287 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:16,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 59812 backedges. 10902 proven. 574 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2018-04-11 13:58:17,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:17,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:17,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 743 proven. 0 refuted. 0 times theorem prover too weak. 4570 trivial. 0 not checked. [2018-04-11 13:58:17,552 INFO L182 omatonBuilderFactory]: Interpolants [43872#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 43873#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 14), 43874#(<= main_~i~1 14), 43875#(<= main_~i~1 15), 43856#true, 43857#false, 43858#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 43859#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 43860#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 43861#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 43862#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 43863#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 43864#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 43865#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 43866#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 43867#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 43868#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 43869#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 43870#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 43871#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13))] [2018-04-11 13:58:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 59812 backedges. 10902 proven. 574 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2018-04-11 13:58:17,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:17,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:17,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:17,553 INFO L87 Difference]: Start difference. First operand 362 states and 458 transitions. Second operand 20 states. [2018-04-11 13:58:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:17,747 INFO L93 Difference]: Finished difference Result 529 states and 847 transitions. [2018-04-11 13:58:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:58:17,747 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1045 [2018-04-11 13:58:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:17,749 INFO L225 Difference]: With dead ends: 529 [2018-04-11 13:58:17,749 INFO L226 Difference]: Without dead ends: 529 [2018-04-11 13:58:17,749 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:58:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-11 13:58:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 371. [2018-04-11 13:58:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-11 13:58:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 484 transitions. [2018-04-11 13:58:17,754 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 484 transitions. Word has length 1045 [2018-04-11 13:58:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:17,755 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 484 transitions. [2018-04-11 13:58:17,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 484 transitions. [2018-04-11 13:58:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2018-04-11 13:58:17,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:17,760 INFO L355 BasicCegarLoop]: trace histogram [153, 134, 134, 134, 134, 134, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:17,760 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1391339608, now seen corresponding path program 64 times [2018-04-11 13:58:17,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:17,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 60648 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 59584 trivial. 0 not checked. [2018-04-11 13:58:19,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:19,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:19,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-04-11 13:58:19,032 INFO L182 omatonBuilderFactory]: Interpolants [44806#true, 44807#false, 44808#(= main_~i~1 0), 44809#(<= main_~i~1 1), 44810#(<= main_~i~1 2), 44811#(<= main_~i~1 3), 44812#(<= main_~i~1 4), 44813#(<= main_~i~1 5), 44814#(<= main_~i~1 6), 44815#(<= main_~i~1 7), 44816#(<= main_~i~1 8), 44817#(<= main_~i~1 9), 44818#(<= main_~i~1 10), 44819#(<= main_~i~1 11), 44820#(<= main_~i~1 12), 44821#(<= main_~i~1 13), 44822#(<= main_~i~1 14), 44823#(<= main_~i~1 15), 44824#(<= main_~i~1 16), 44825#(<= main_~i~1 17), 44826#(<= main_~i~1 18), 44827#(<= main_~i~1 19)] [2018-04-11 13:58:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 60648 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 59584 trivial. 0 not checked. [2018-04-11 13:58:19,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:19,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:19,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:19,033 INFO L87 Difference]: Start difference. First operand 371 states and 484 transitions. Second operand 22 states. [2018-04-11 13:58:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:19,225 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2018-04-11 13:58:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:58:19,226 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1051 [2018-04-11 13:58:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:19,227 INFO L225 Difference]: With dead ends: 545 [2018-04-11 13:58:19,227 INFO L226 Difference]: Without dead ends: 545 [2018-04-11 13:58:19,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-04-11 13:58:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 382. [2018-04-11 13:58:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-11 13:58:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-04-11 13:58:19,232 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1051 [2018-04-11 13:58:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:19,232 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-04-11 13:58:19,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-04-11 13:58:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2018-04-11 13:58:19,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:19,238 INFO L355 BasicCegarLoop]: trace histogram [162, 142, 142, 142, 142, 142, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:19,238 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash 131832409, now seen corresponding path program 65 times [2018-04-11 13:58:19,239 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:19,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 68066 backedges. 5302 proven. 2377 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:20,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:20,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:58:20,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 598 proven. 150 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:20,488 INFO L182 omatonBuilderFactory]: Interpolants [45760#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 45761#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 45762#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 45763#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 45764#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 45765#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 45766#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 45767#(<= main_~i~1 8), 45768#(<= main_~i~1 9), 45769#(<= main_~i~1 10), 45770#(<= main_~i~1 11), 45771#(<= main_~i~1 12), 45755#true, 45756#false, 45757#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 45758#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 45759#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2))] [2018-04-11 13:58:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 68066 backedges. 5302 proven. 2377 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:20,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:58:20,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:58:20,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:58:20,489 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 17 states. [2018-04-11 13:58:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:20,686 INFO L93 Difference]: Finished difference Result 796 states and 1255 transitions. [2018-04-11 13:58:20,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:58:20,686 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1111 [2018-04-11 13:58:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:20,690 INFO L225 Difference]: With dead ends: 796 [2018-04-11 13:58:20,690 INFO L226 Difference]: Without dead ends: 796 [2018-04-11 13:58:20,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:58:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-04-11 13:58:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 385. [2018-04-11 13:58:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-11 13:58:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-04-11 13:58:20,698 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1111 [2018-04-11 13:58:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:20,699 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-04-11 13:58:20,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:58:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-04-11 13:58:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-04-11 13:58:20,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:20,704 INFO L355 BasicCegarLoop]: trace histogram [163, 143, 143, 143, 143, 143, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:20,704 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 215225761, now seen corresponding path program 66 times [2018-04-11 13:58:20,705 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:20,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 68958 backedges. 5886 proven. 2685 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:21,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:21,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:58:21,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 574 proven. 168 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:21,996 INFO L182 omatonBuilderFactory]: Interpolants [46976#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 46977#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 46978#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 46979#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 46980#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 46981#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 46982#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 46983#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 46984#(<= main_~i~1 9), 46985#(<= main_~i~1 10), 46986#(<= main_~i~1 11), 46987#(<= main_~i~1 12), 46988#(<= main_~i~1 13), 46971#true, 46972#false, 46973#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 46974#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 46975#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2))] [2018-04-11 13:58:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 68958 backedges. 5886 proven. 2685 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:21,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:58:21,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:58:21,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:58:21,998 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 18 states. [2018-04-11 13:58:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:22,227 INFO L93 Difference]: Finished difference Result 799 states and 1334 transitions. [2018-04-11 13:58:22,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:58:22,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1117 [2018-04-11 13:58:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:22,231 INFO L225 Difference]: With dead ends: 799 [2018-04-11 13:58:22,231 INFO L226 Difference]: Without dead ends: 799 [2018-04-11 13:58:22,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:58:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-11 13:58:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 385. [2018-04-11 13:58:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-11 13:58:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-04-11 13:58:22,240 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1117 [2018-04-11 13:58:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:22,240 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-04-11 13:58:22,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:58:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-04-11 13:58:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1124 [2018-04-11 13:58:22,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:22,246 INFO L355 BasicCegarLoop]: trace histogram [164, 144, 144, 144, 144, 144, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:22,246 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash -150668567, now seen corresponding path program 67 times [2018-04-11 13:58:22,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:22,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 69856 backedges. 6470 proven. 2999 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:23,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:23,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:58:23,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6087 backedges. 574 proven. 186 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:23,623 INFO L182 omatonBuilderFactory]: Interpolants [48193#true, 48194#false, 48195#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 48196#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 48197#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 48198#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 48199#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 48200#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 48201#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 48202#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 48203#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 48204#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 48205#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 48206#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 48207#(<= main_~i~1 10), 48208#(<= main_~i~1 11), 48209#(<= main_~i~1 12), 48210#(<= main_~i~1 13), 48211#(<= main_~i~1 14)] [2018-04-11 13:58:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 69856 backedges. 6470 proven. 2999 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:23,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:58:23,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:58:23,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:58:23,625 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 19 states. [2018-04-11 13:58:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:23,873 INFO L93 Difference]: Finished difference Result 802 states and 1413 transitions. [2018-04-11 13:58:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:58:23,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1123 [2018-04-11 13:58:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:23,876 INFO L225 Difference]: With dead ends: 802 [2018-04-11 13:58:23,877 INFO L226 Difference]: Without dead ends: 802 [2018-04-11 13:58:23,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:58:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-04-11 13:58:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 385. [2018-04-11 13:58:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-11 13:58:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-04-11 13:58:23,886 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1123 [2018-04-11 13:58:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:23,886 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-04-11 13:58:23,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:58:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-04-11 13:58:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2018-04-11 13:58:23,892 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:23,892 INFO L355 BasicCegarLoop]: trace histogram [165, 145, 145, 145, 145, 145, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:23,892 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1358350897, now seen corresponding path program 68 times [2018-04-11 13:58:23,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:23,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 70760 backedges. 7054 proven. 3319 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:25,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:25,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:25,295 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 574 proven. 204 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:25,295 INFO L182 omatonBuilderFactory]: Interpolants [49440#(<= main_~i~1 15), 49421#true, 49422#false, 49423#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 49424#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 49425#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 49426#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 49427#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 49428#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 49429#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 49430#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 49431#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 49432#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 49433#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 49434#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 49435#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 49436#(<= main_~i~1 11), 49437#(<= main_~i~1 12), 49438#(<= main_~i~1 13), 49439#(<= main_~i~1 14)] [2018-04-11 13:58:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 70760 backedges. 7054 proven. 3319 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:25,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:25,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:25,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:25,297 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 20 states. [2018-04-11 13:58:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:25,579 INFO L93 Difference]: Finished difference Result 805 states and 1492 transitions. [2018-04-11 13:58:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:58:25,580 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1129 [2018-04-11 13:58:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:25,584 INFO L225 Difference]: With dead ends: 805 [2018-04-11 13:58:25,584 INFO L226 Difference]: Without dead ends: 805 [2018-04-11 13:58:25,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:58:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-04-11 13:58:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 385. [2018-04-11 13:58:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-11 13:58:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2018-04-11 13:58:25,595 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 1129 [2018-04-11 13:58:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:25,595 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2018-04-11 13:58:25,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2018-04-11 13:58:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2018-04-11 13:58:25,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:25,601 INFO L355 BasicCegarLoop]: trace histogram [166, 146, 146, 146, 146, 146, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:25,601 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1127087239, now seen corresponding path program 69 times [2018-04-11 13:58:25,602 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:25,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 71670 backedges. 7638 proven. 3645 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:27,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:27,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:58:27,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 574 proven. 222 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:27,094 INFO L182 omatonBuilderFactory]: Interpolants [50656#false, 50657#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 50658#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 50659#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 50660#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 50661#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 50662#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 50663#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 50664#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 50665#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 50666#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 50667#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 50668#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 50669#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 50670#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 50671#(<= main_~i~1 12), 50672#(<= main_~i~1 13), 50673#(<= main_~i~1 14), 50674#(<= main_~i~1 15), 50675#(<= main_~i~1 16), 50655#true] [2018-04-11 13:58:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 71670 backedges. 7638 proven. 3645 refuted. 0 times theorem prover too weak. 60387 trivial. 0 not checked. [2018-04-11 13:58:27,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:58:27,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:58:27,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:27,096 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand 21 states. [2018-04-11 13:58:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:27,391 INFO L93 Difference]: Finished difference Result 805 states and 1492 transitions. [2018-04-11 13:58:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:58:27,391 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1135 [2018-04-11 13:58:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:27,395 INFO L225 Difference]: With dead ends: 805 [2018-04-11 13:58:27,395 INFO L226 Difference]: Without dead ends: 805 [2018-04-11 13:58:27,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:58:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-04-11 13:58:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 382. [2018-04-11 13:58:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-11 13:58:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-04-11 13:58:27,406 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1135 [2018-04-11 13:58:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:27,406 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-04-11 13:58:27,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:58:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-04-11 13:58:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2018-04-11 13:58:27,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:27,412 INFO L355 BasicCegarLoop]: trace histogram [167, 147, 147, 147, 147, 147, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:27,412 INFO L408 AbstractCegarLoop]: === Iteration 81 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1134614847, now seen corresponding path program 70 times [2018-04-11 13:58:27,413 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:27,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 72586 backedges. 9209 proven. 2890 refuted. 0 times theorem prover too weak. 60487 trivial. 0 not checked. [2018-04-11 13:58:28,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:28,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:58:28,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6144 backedges. 657 proven. 160 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:28,969 INFO L182 omatonBuilderFactory]: Interpolants [51904#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 51905#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13), 51906#(<= main_~i~1 13), 51907#(<= main_~i~1 14), 51908#(<= main_~i~1 15), 51909#(<= main_~i~1 16), 51889#true, 51890#false, 51891#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 51892#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 51893#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 51894#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 51895#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 51896#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 51897#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 51898#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 51899#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 51900#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 51901#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 51902#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 51903#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12))] [2018-04-11 13:58:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 72586 backedges. 9209 proven. 2890 refuted. 0 times theorem prover too weak. 60487 trivial. 0 not checked. [2018-04-11 13:58:28,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:58:28,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:58:28,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:28,971 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 21 states. [2018-04-11 13:58:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:29,234 INFO L93 Difference]: Finished difference Result 730 states and 1319 transitions. [2018-04-11 13:58:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:58:29,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1141 [2018-04-11 13:58:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:29,239 INFO L225 Difference]: With dead ends: 730 [2018-04-11 13:58:29,240 INFO L226 Difference]: Without dead ends: 730 [2018-04-11 13:58:29,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=374, Invalid=816, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:58:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-04-11 13:58:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 382. [2018-04-11 13:58:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-11 13:58:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-04-11 13:58:29,258 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1141 [2018-04-11 13:58:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:29,259 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-04-11 13:58:29,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:58:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-04-11 13:58:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2018-04-11 13:58:29,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:29,265 INFO L355 BasicCegarLoop]: trace histogram [168, 148, 148, 148, 148, 148, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:29,265 INFO L408 AbstractCegarLoop]: === Iteration 82 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 674155337, now seen corresponding path program 71 times [2018-04-11 13:58:29,266 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:29,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 73508 backedges. 11014 proven. 1901 refuted. 0 times theorem prover too weak. 60593 trivial. 0 not checked. [2018-04-11 13:58:30,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:30,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:58:30,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6156 backedges. 743 proven. 86 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:30,759 INFO L182 omatonBuilderFactory]: Interpolants [53056#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 53057#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 53058#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 53059#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 53060#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 53061#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 53062#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 53063#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 53064#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 53065#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 53066#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 53067#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 14), 53068#(<= main_~i~1 14), 53069#(<= main_~i~1 15), 53070#(<= main_~i~1 16), 53050#true, 53051#false, 53052#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 53053#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 53054#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 53055#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3))] [2018-04-11 13:58:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 73508 backedges. 11014 proven. 1901 refuted. 0 times theorem prover too weak. 60593 trivial. 0 not checked. [2018-04-11 13:58:30,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:58:30,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:58:30,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:30,761 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 21 states. [2018-04-11 13:58:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:31,028 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2018-04-11 13:58:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:58:31,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1147 [2018-04-11 13:58:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:31,072 INFO L225 Difference]: With dead ends: 647 [2018-04-11 13:58:31,073 INFO L226 Difference]: Without dead ends: 647 [2018-04-11 13:58:31,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=417, Invalid=843, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 13:58:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-04-11 13:58:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 382. [2018-04-11 13:58:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-04-11 13:58:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2018-04-11 13:58:31,086 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 1147 [2018-04-11 13:58:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:31,086 INFO L459 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2018-04-11 13:58:31,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:58:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2018-04-11 13:58:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2018-04-11 13:58:31,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:31,097 INFO L355 BasicCegarLoop]: trace histogram [169, 149, 149, 149, 149, 149, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:31,097 INFO L408 AbstractCegarLoop]: === Iteration 83 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1101819631, now seen corresponding path program 72 times [2018-04-11 13:58:31,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:31,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 74436 backedges. 13071 proven. 660 refuted. 0 times theorem prover too weak. 60705 trivial. 0 not checked. [2018-04-11 13:58:32,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:32,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:58:32,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 835 proven. 0 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2018-04-11 13:58:32,663 INFO L182 omatonBuilderFactory]: Interpolants [54144#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 54145#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 54146#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 54147#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 54148#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 15), 54149#(<= main_~i~1 15), 54150#(<= main_~i~1 16), 54130#true, 54131#false, 54132#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 54133#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 54134#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 54135#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 54136#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 54137#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 54138#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 54139#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 54140#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 54141#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 54142#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 54143#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11))] [2018-04-11 13:58:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 74436 backedges. 13071 proven. 660 refuted. 0 times theorem prover too weak. 60705 trivial. 0 not checked. [2018-04-11 13:58:32,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:58:32,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:58:32,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:32,665 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 21 states. [2018-04-11 13:58:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:32,891 INFO L93 Difference]: Finished difference Result 557 states and 927 transitions. [2018-04-11 13:58:32,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:58:32,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1153 [2018-04-11 13:58:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:32,893 INFO L225 Difference]: With dead ends: 557 [2018-04-11 13:58:32,894 INFO L226 Difference]: Without dead ends: 557 [2018-04-11 13:58:32,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:58:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-11 13:58:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 391. [2018-04-11 13:58:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-04-11 13:58:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 527 transitions. [2018-04-11 13:58:32,901 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 527 transitions. Word has length 1153 [2018-04-11 13:58:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:32,901 INFO L459 AbstractCegarLoop]: Abstraction has 391 states and 527 transitions. [2018-04-11 13:58:32,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:58:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2018-04-11 13:58:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2018-04-11 13:58:32,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:32,908 INFO L355 BasicCegarLoop]: trace histogram [170, 150, 150, 150, 150, 150, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:32,908 INFO L408 AbstractCegarLoop]: === Iteration 84 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1971750937, now seen corresponding path program 73 times [2018-04-11 13:58:32,909 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:32,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 75370 backedges. 2859 proven. 5694 refuted. 0 times theorem prover too weak. 66817 trivial. 0 not checked. [2018-04-11 13:58:34,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:34,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:34,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6159 backedges. 227 proven. 518 refuted. 0 times theorem prover too weak. 5414 trivial. 0 not checked. [2018-04-11 13:58:34,529 INFO L182 omatonBuilderFactory]: Interpolants [55136#(<= 3 main_~i~1), 55137#(<= 4 main_~i~1), 55138#(<= 5 main_~i~1), 55139#(<= 6 main_~i~1), 55140#(<= 7 main_~i~1), 55141#(<= 8 main_~i~1), 55142#(<= 9 main_~i~1), 55143#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 55144#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 55145#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 55146#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 55147#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 55148#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 55149#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 55150#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 55151#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 55152#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 55131#true, 55132#false, 55133#(<= 0 main_~i~1), 55134#(<= 1 main_~i~1), 55135#(<= 2 main_~i~1)] [2018-04-11 13:58:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 75370 backedges. 2859 proven. 5694 refuted. 0 times theorem prover too weak. 66817 trivial. 0 not checked. [2018-04-11 13:58:34,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:34,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:34,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:34,531 INFO L87 Difference]: Start difference. First operand 391 states and 527 transitions. Second operand 22 states. [2018-04-11 13:58:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:34,991 INFO L93 Difference]: Finished difference Result 439 states and 572 transitions. [2018-04-11 13:58:34,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:58:34,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1159 [2018-04-11 13:58:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:34,992 INFO L225 Difference]: With dead ends: 439 [2018-04-11 13:58:34,992 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 13:58:34,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:58:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 13:58:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 394. [2018-04-11 13:58:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-04-11 13:58:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 536 transitions. [2018-04-11 13:58:34,996 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 536 transitions. Word has length 1159 [2018-04-11 13:58:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:34,996 INFO L459 AbstractCegarLoop]: Abstraction has 394 states and 536 transitions. [2018-04-11 13:58:34,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 536 transitions. [2018-04-11 13:58:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1202 [2018-04-11 13:58:35,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:35,003 INFO L355 BasicCegarLoop]: trace histogram [177, 157, 157, 157, 157, 157, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:35,003 INFO L408 AbstractCegarLoop]: === Iteration 85 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1076968977, now seen corresponding path program 74 times [2018-04-11 13:58:35,003 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:35,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 82076 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 80896 trivial. 0 not checked. [2018-04-11 13:58:36,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:36,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:58:36,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6432 trivial. 0 not checked. [2018-04-11 13:58:36,694 INFO L182 omatonBuilderFactory]: Interpolants [56004#true, 56005#false, 56006#(= main_~i~1 0), 56007#(<= main_~i~1 1), 56008#(<= main_~i~1 2), 56009#(<= main_~i~1 3), 56010#(<= main_~i~1 4), 56011#(<= main_~i~1 5), 56012#(<= main_~i~1 6), 56013#(<= main_~i~1 7), 56014#(<= main_~i~1 8), 56015#(<= main_~i~1 9), 56016#(<= main_~i~1 10), 56017#(<= main_~i~1 11), 56018#(<= main_~i~1 12), 56019#(<= main_~i~1 13), 56020#(<= main_~i~1 14), 56021#(<= main_~i~1 15), 56022#(<= main_~i~1 16), 56023#(<= main_~i~1 17), 56024#(<= main_~i~1 18), 56025#(<= main_~i~1 19), 56026#(<= main_~i~1 20)] [2018-04-11 13:58:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 82076 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 80896 trivial. 0 not checked. [2018-04-11 13:58:36,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:58:36,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:58:36,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:58:36,696 INFO L87 Difference]: Start difference. First operand 394 states and 536 transitions. Second operand 23 states. [2018-04-11 13:58:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:36,894 INFO L93 Difference]: Finished difference Result 605 states and 798 transitions. [2018-04-11 13:58:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:58:36,895 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1201 [2018-04-11 13:58:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:36,896 INFO L225 Difference]: With dead ends: 605 [2018-04-11 13:58:36,897 INFO L226 Difference]: Without dead ends: 605 [2018-04-11 13:58:36,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:58:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-04-11 13:58:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 405. [2018-04-11 13:58:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 13:58:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-04-11 13:58:36,902 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1201 [2018-04-11 13:58:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:36,902 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-04-11 13:58:36,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:58:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-04-11 13:58:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1268 [2018-04-11 13:58:36,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:36,909 INFO L355 BasicCegarLoop]: trace histogram [187, 166, 166, 166, 166, 166, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:36,909 INFO L408 AbstractCegarLoop]: === Iteration 86 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1431634982, now seen corresponding path program 75 times [2018-04-11 13:58:36,910 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:36,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 6378 proven. 3626 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:38,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:38,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 13:58:38,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7311 backedges. 637 proven. 224 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:38,640 INFO L182 omatonBuilderFactory]: Interpolants [57037#true, 57038#false, 57039#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 57040#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 57041#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 57042#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 57043#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 57044#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 57045#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 57046#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 57047#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 57048#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 57049#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 57050#(<= main_~i~1 9), 57051#(<= main_~i~1 10), 57052#(<= main_~i~1 11), 57053#(<= main_~i~1 12), 57054#(<= main_~i~1 13), 57055#(<= main_~i~1 14)] [2018-04-11 13:58:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 91704 backedges. 6378 proven. 3626 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:38,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:58:38,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:58:38,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:58:38,642 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 19 states. [2018-04-11 13:58:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:38,892 INFO L93 Difference]: Finished difference Result 914 states and 1573 transitions. [2018-04-11 13:58:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:58:38,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1267 [2018-04-11 13:58:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:38,899 INFO L225 Difference]: With dead ends: 914 [2018-04-11 13:58:38,899 INFO L226 Difference]: Without dead ends: 914 [2018-04-11 13:58:38,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2018-04-11 13:58:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-04-11 13:58:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 408. [2018-04-11 13:58:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-11 13:58:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2018-04-11 13:58:38,915 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 1267 [2018-04-11 13:58:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:38,916 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2018-04-11 13:58:38,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:58:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2018-04-11 13:58:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1274 [2018-04-11 13:58:38,927 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:38,928 INFO L355 BasicCegarLoop]: trace histogram [188, 167, 167, 167, 167, 167, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:38,928 INFO L408 AbstractCegarLoop]: === Iteration 87 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 252508962, now seen corresponding path program 76 times [2018-04-11 13:58:38,929 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:39,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 92742 backedges. 7004 proven. 4038 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:40,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:40,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:40,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7314 backedges. 616 proven. 248 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:40,838 INFO L182 omatonBuilderFactory]: Interpolants [58400#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 58401#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 58402#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 58403#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 58404#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 58405#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 58406#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 58407#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 58408#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 58409#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 58410#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 58411#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 58412#(<= main_~i~1 10), 58413#(<= main_~i~1 11), 58414#(<= main_~i~1 12), 58415#(<= main_~i~1 13), 58416#(<= main_~i~1 14), 58417#(<= main_~i~1 15), 58398#true, 58399#false] [2018-04-11 13:58:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 92742 backedges. 7004 proven. 4038 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:40,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:40,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:40,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:40,841 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand 20 states. [2018-04-11 13:58:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:41,110 INFO L93 Difference]: Finished difference Result 917 states and 1668 transitions. [2018-04-11 13:58:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:58:41,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1273 [2018-04-11 13:58:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:41,115 INFO L225 Difference]: With dead ends: 917 [2018-04-11 13:58:41,115 INFO L226 Difference]: Without dead ends: 917 [2018-04-11 13:58:41,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:58:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-11 13:58:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 408. [2018-04-11 13:58:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-11 13:58:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2018-04-11 13:58:41,132 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 1273 [2018-04-11 13:58:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:41,132 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2018-04-11 13:58:41,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2018-04-11 13:58:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2018-04-11 13:58:41,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:41,144 INFO L355 BasicCegarLoop]: trace histogram [189, 168, 168, 168, 168, 168, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:41,144 INFO L408 AbstractCegarLoop]: === Iteration 88 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:41,145 INFO L82 PathProgramCache]: Analyzing trace with hash 477389930, now seen corresponding path program 77 times [2018-04-11 13:58:41,145 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:41,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 93786 backedges. 7630 proven. 4456 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:42,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:42,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:58:42,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 616 proven. 272 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:42,974 INFO L182 omatonBuilderFactory]: Interpolants [59776#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 59777#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 59778#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 59779#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 59780#(<= main_~i~1 11), 59781#(<= main_~i~1 12), 59782#(<= main_~i~1 13), 59783#(<= main_~i~1 14), 59784#(<= main_~i~1 15), 59785#(<= main_~i~1 16), 59765#true, 59766#false, 59767#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 59768#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 59769#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 59770#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 59771#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 59772#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 59773#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 59774#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 59775#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8))] [2018-04-11 13:58:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 93786 backedges. 7630 proven. 4456 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:42,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:58:42,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:58:42,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:58:42,976 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand 21 states. [2018-04-11 13:58:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:43,233 INFO L93 Difference]: Finished difference Result 920 states and 1763 transitions. [2018-04-11 13:58:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:58:43,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1279 [2018-04-11 13:58:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:43,238 INFO L225 Difference]: With dead ends: 920 [2018-04-11 13:58:43,238 INFO L226 Difference]: Without dead ends: 920 [2018-04-11 13:58:43,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:58:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-04-11 13:58:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 408. [2018-04-11 13:58:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-11 13:58:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 574 transitions. [2018-04-11 13:58:43,249 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 574 transitions. Word has length 1279 [2018-04-11 13:58:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:43,250 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 574 transitions. [2018-04-11 13:58:43,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:58:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 574 transitions. [2018-04-11 13:58:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1286 [2018-04-11 13:58:43,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:43,257 INFO L355 BasicCegarLoop]: trace histogram [190, 169, 169, 169, 169, 169, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:43,258 INFO L408 AbstractCegarLoop]: === Iteration 89 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1884702798, now seen corresponding path program 78 times [2018-04-11 13:58:43,258 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:43,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 94836 backedges. 8256 proven. 4880 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:45,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:45,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:45,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7362 backedges. 616 proven. 296 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:45,169 INFO L182 omatonBuilderFactory]: Interpolants [61152#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 61153#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 61154#(<= main_~i~1 12), 61155#(<= main_~i~1 13), 61156#(<= main_~i~1 14), 61157#(<= main_~i~1 15), 61158#(<= main_~i~1 16), 61159#(<= main_~i~1 17), 61138#true, 61139#false, 61140#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 61141#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 61142#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 61143#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 61144#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 61145#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 61146#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 61147#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 61148#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 61149#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 61150#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 61151#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11))] [2018-04-11 13:58:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 94836 backedges. 8256 proven. 4880 refuted. 0 times theorem prover too weak. 81700 trivial. 0 not checked. [2018-04-11 13:58:45,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:45,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:45,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:45,171 INFO L87 Difference]: Start difference. First operand 408 states and 574 transitions. Second operand 22 states. [2018-04-11 13:58:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:45,431 INFO L93 Difference]: Finished difference Result 920 states and 1763 transitions. [2018-04-11 13:58:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:58:45,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1285 [2018-04-11 13:58:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:45,436 INFO L225 Difference]: With dead ends: 920 [2018-04-11 13:58:45,436 INFO L226 Difference]: Without dead ends: 920 [2018-04-11 13:58:45,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=342, Invalid=848, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:58:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-04-11 13:58:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 405. [2018-04-11 13:58:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 13:58:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-04-11 13:58:45,448 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1285 [2018-04-11 13:58:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:45,449 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-04-11 13:58:45,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-04-11 13:58:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1292 [2018-04-11 13:58:45,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:45,456 INFO L355 BasicCegarLoop]: trace histogram [191, 170, 170, 170, 170, 170, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:45,456 INFO L408 AbstractCegarLoop]: === Iteration 90 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1927973638, now seen corresponding path program 79 times [2018-04-11 13:58:45,457 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:45,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 95892 backedges. 9875 proven. 4217 refuted. 0 times theorem prover too weak. 81800 trivial. 0 not checked. [2018-04-11 13:58:47,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:47,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:47,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7389 backedges. 699 proven. 240 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:47,402 INFO L182 omatonBuilderFactory]: Interpolants [62528#(<= main_~i~1 13), 62529#(<= main_~i~1 14), 62530#(<= main_~i~1 15), 62531#(<= main_~i~1 16), 62532#(<= main_~i~1 17), 62511#true, 62512#false, 62513#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 62514#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 62515#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 62516#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 62517#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 62518#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 62519#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 62520#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 62521#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 62522#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 62523#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 62524#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 62525#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 62526#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 62527#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13)] [2018-04-11 13:58:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 95892 backedges. 9875 proven. 4217 refuted. 0 times theorem prover too weak. 81800 trivial. 0 not checked. [2018-04-11 13:58:47,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:47,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:47,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:47,404 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-04-11 13:58:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:47,722 INFO L93 Difference]: Finished difference Result 851 states and 1604 transitions. [2018-04-11 13:58:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:58:47,723 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1291 [2018-04-11 13:58:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:47,726 INFO L225 Difference]: With dead ends: 851 [2018-04-11 13:58:47,726 INFO L226 Difference]: Without dead ends: 851 [2018-04-11 13:58:47,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=380, Invalid=880, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 13:58:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-04-11 13:58:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 405. [2018-04-11 13:58:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 13:58:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-04-11 13:58:47,737 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1291 [2018-04-11 13:58:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:47,738 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-04-11 13:58:47,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-04-11 13:58:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-04-11 13:58:47,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:47,745 INFO L355 BasicCegarLoop]: trace histogram [192, 171, 171, 171, 171, 171, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:47,745 INFO L408 AbstractCegarLoop]: === Iteration 91 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:47,746 INFO L82 PathProgramCache]: Analyzing trace with hash 406344578, now seen corresponding path program 80 times [2018-04-11 13:58:47,746 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:47,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 96954 backedges. 11728 proven. 3320 refuted. 0 times theorem prover too weak. 81906 trivial. 0 not checked. [2018-04-11 13:58:49,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:49,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:49,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7407 backedges. 785 proven. 172 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:49,765 INFO L182 omatonBuilderFactory]: Interpolants [63817#true, 63818#false, 63819#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 63820#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 63821#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 63822#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 63823#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 63824#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 63825#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 63826#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 63827#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 63828#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 63829#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 63830#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 63831#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 63832#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 63833#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 63834#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 14), 63835#(<= main_~i~1 14), 63836#(<= main_~i~1 15), 63837#(<= main_~i~1 16), 63838#(<= main_~i~1 17)] [2018-04-11 13:58:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 96954 backedges. 11728 proven. 3320 refuted. 0 times theorem prover too weak. 81906 trivial. 0 not checked. [2018-04-11 13:58:49,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:49,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:49,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:49,767 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-04-11 13:58:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:50,087 INFO L93 Difference]: Finished difference Result 770 states and 1414 transitions. [2018-04-11 13:58:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:58:50,087 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1297 [2018-04-11 13:58:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:50,090 INFO L225 Difference]: With dead ends: 770 [2018-04-11 13:58:50,090 INFO L226 Difference]: Without dead ends: 770 [2018-04-11 13:58:50,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=422, Invalid=910, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:58:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-04-11 13:58:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 405. [2018-04-11 13:58:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 13:58:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-04-11 13:58:50,100 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1297 [2018-04-11 13:58:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:50,100 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-04-11 13:58:50,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-04-11 13:58:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1304 [2018-04-11 13:58:50,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:50,108 INFO L355 BasicCegarLoop]: trace histogram [193, 172, 172, 172, 172, 172, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:50,108 INFO L408 AbstractCegarLoop]: === Iteration 92 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash -233508022, now seen corresponding path program 81 times [2018-04-11 13:58:50,108 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:50,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 98022 backedges. 13833 proven. 2171 refuted. 0 times theorem prover too weak. 82018 trivial. 0 not checked. [2018-04-11 13:58:52,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:52,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:52,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7419 backedges. 877 proven. 92 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:52,101 INFO L182 omatonBuilderFactory]: Interpolants [65056#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 65057#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 65058#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 65059#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 65060#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 65061#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 65062#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 15), 65063#(<= main_~i~1 15), 65064#(<= main_~i~1 16), 65065#(<= main_~i~1 17), 65044#true, 65045#false, 65046#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 65047#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 65048#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 65049#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 65050#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 65051#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 65052#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 65053#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 65054#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 65055#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9))] [2018-04-11 13:58:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 98022 backedges. 13833 proven. 2171 refuted. 0 times theorem prover too weak. 82018 trivial. 0 not checked. [2018-04-11 13:58:52,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:52,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:52,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:52,103 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-04-11 13:58:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:52,400 INFO L93 Difference]: Finished difference Result 681 states and 1196 transitions. [2018-04-11 13:58:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 13:58:52,400 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1303 [2018-04-11 13:58:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:52,403 INFO L225 Difference]: With dead ends: 681 [2018-04-11 13:58:52,403 INFO L226 Difference]: Without dead ends: 681 [2018-04-11 13:58:52,403 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=468, Invalid=938, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:58:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-04-11 13:58:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 405. [2018-04-11 13:58:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 13:58:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2018-04-11 13:58:52,413 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 1303 [2018-04-11 13:58:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:52,414 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2018-04-11 13:58:52,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2018-04-11 13:58:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1310 [2018-04-11 13:58:52,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:52,421 INFO L355 BasicCegarLoop]: trace histogram [194, 173, 173, 173, 173, 173, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:52,421 INFO L408 AbstractCegarLoop]: === Iteration 93 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash -722705326, now seen corresponding path program 82 times [2018-04-11 13:58:52,422 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:52,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 99096 backedges. 16208 proven. 752 refuted. 0 times theorem prover too weak. 82136 trivial. 0 not checked. [2018-04-11 13:58:54,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:54,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:58:54,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 6450 trivial. 0 not checked. [2018-04-11 13:58:54,417 INFO L182 omatonBuilderFactory]: Interpolants [66185#false, 66184#true, 66187#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 66186#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 66189#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 66188#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 66191#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 66190#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 66193#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 66192#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 66195#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 66194#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 66197#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 66196#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 66199#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 66198#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 66201#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 66200#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 66203#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 16), 66202#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 16)), 66205#(<= main_~i~1 17), 66204#(<= main_~i~1 16)] [2018-04-11 13:58:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 99096 backedges. 16208 proven. 752 refuted. 0 times theorem prover too weak. 82136 trivial. 0 not checked. [2018-04-11 13:58:54,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:58:54,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:58:54,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:58:54,420 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand 22 states. [2018-04-11 13:58:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:54,703 INFO L93 Difference]: Finished difference Result 585 states and 987 transitions. [2018-04-11 13:58:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 13:58:54,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1309 [2018-04-11 13:58:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:54,706 INFO L225 Difference]: With dead ends: 585 [2018-04-11 13:58:54,706 INFO L226 Difference]: Without dead ends: 585 [2018-04-11 13:58:54,706 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:58:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-04-11 13:58:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 414. [2018-04-11 13:58:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-04-11 13:58:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 581 transitions. [2018-04-11 13:58:54,712 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 581 transitions. Word has length 1309 [2018-04-11 13:58:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:54,713 INFO L459 AbstractCegarLoop]: Abstraction has 414 states and 581 transitions. [2018-04-11 13:58:54,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:58:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 581 transitions. [2018-04-11 13:58:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1316 [2018-04-11 13:58:54,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:54,720 INFO L355 BasicCegarLoop]: trace histogram [195, 174, 174, 174, 174, 174, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:54,720 INFO L408 AbstractCegarLoop]: === Iteration 94 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:54,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1802118810, now seen corresponding path program 83 times [2018-04-11 13:58:54,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:54,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 100176 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 98874 trivial. 0 not checked. [2018-04-11 13:58:56,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:56,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:58:56,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7422 trivial. 0 not checked. [2018-04-11 13:58:56,726 INFO L182 omatonBuilderFactory]: Interpolants [67239#true, 67241#(= main_~i~1 0), 67240#false, 67243#(<= main_~i~1 2), 67242#(<= main_~i~1 1), 67245#(<= main_~i~1 4), 67244#(<= main_~i~1 3), 67247#(<= main_~i~1 6), 67246#(<= main_~i~1 5), 67249#(<= main_~i~1 8), 67248#(<= main_~i~1 7), 67251#(<= main_~i~1 10), 67250#(<= main_~i~1 9), 67253#(<= main_~i~1 12), 67252#(<= main_~i~1 11), 67255#(<= main_~i~1 14), 67254#(<= main_~i~1 13), 67257#(<= main_~i~1 16), 67256#(<= main_~i~1 15), 67259#(<= main_~i~1 18), 67258#(<= main_~i~1 17), 67261#(<= main_~i~1 20), 67260#(<= main_~i~1 19), 67262#(<= main_~i~1 21)] [2018-04-11 13:58:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 100176 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 98874 trivial. 0 not checked. [2018-04-11 13:58:56,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:58:56,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:58:56,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:58:56,728 INFO L87 Difference]: Start difference. First operand 414 states and 581 transitions. Second operand 24 states. [2018-04-11 13:58:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:56,903 INFO L93 Difference]: Finished difference Result 668 states and 935 transitions. [2018-04-11 13:58:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:58:56,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1315 [2018-04-11 13:58:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:56,905 INFO L225 Difference]: With dead ends: 668 [2018-04-11 13:58:56,905 INFO L226 Difference]: Without dead ends: 668 [2018-04-11 13:58:56,906 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:58:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-04-11 13:58:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 425. [2018-04-11 13:58:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 13:58:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-04-11 13:58:56,911 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1315 [2018-04-11 13:58:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:56,912 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-04-11 13:58:56,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:58:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-04-11 13:58:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1382 [2018-04-11 13:58:56,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:56,920 INFO L355 BasicCegarLoop]: trace histogram [205, 183, 183, 183, 183, 183, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:56,920 INFO L408 AbstractCegarLoop]: === Iteration 95 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1157351389, now seen corresponding path program 84 times [2018-04-11 13:58:56,921 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:56,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:58:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 110786 backedges. 6478 proven. 4629 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:58:58,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:58:58,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:58:58,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:58:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8358 backedges. 637 proven. 280 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:58:58,985 INFO L182 omatonBuilderFactory]: Interpolants [68357#false, 68356#true, 68359#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 68358#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 68361#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 68360#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 68363#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 68362#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 68365#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 68364#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 68367#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 68366#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 68369#(<= main_~i~1 9), 68368#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 68371#(<= main_~i~1 11), 68370#(<= main_~i~1 10), 68373#(<= main_~i~1 13), 68372#(<= main_~i~1 12), 68375#(<= main_~i~1 15), 68374#(<= main_~i~1 14)] [2018-04-11 13:58:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 110786 backedges. 6478 proven. 4629 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:58:58,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:58:58,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:58:58,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:58:58,988 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 20 states. [2018-04-11 13:58:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:58:59,201 INFO L93 Difference]: Finished difference Result 1029 states and 1894 transitions. [2018-04-11 13:58:59,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:58:59,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1381 [2018-04-11 13:58:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:58:59,206 INFO L225 Difference]: With dead ends: 1029 [2018-04-11 13:58:59,206 INFO L226 Difference]: Without dead ends: 1029 [2018-04-11 13:58:59,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:58:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-04-11 13:58:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 428. [2018-04-11 13:58:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-11 13:58:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-04-11 13:58:59,219 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 1381 [2018-04-11 13:58:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:58:59,219 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-04-11 13:58:59,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:58:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-04-11 13:58:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1388 [2018-04-11 13:58:59,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:58:59,228 INFO L355 BasicCegarLoop]: trace histogram [206, 184, 184, 184, 184, 184, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:58:59,228 INFO L408 AbstractCegarLoop]: === Iteration 96 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:58:59,228 INFO L82 PathProgramCache]: Analyzing trace with hash 559584619, now seen corresponding path program 85 times [2018-04-11 13:58:59,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:58:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:58:59,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 111928 backedges. 7104 proven. 5145 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:59:01,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:01,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:59:01,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8367 backedges. 616 proven. 310 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:01,376 INFO L182 omatonBuilderFactory]: Interpolants [69857#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 69856#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 69859#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 69858#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 69861#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 69860#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 69863#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 69862#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 69865#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 69864#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 69867#(<= main_~i~1 10), 69866#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 69869#(<= main_~i~1 12), 69868#(<= main_~i~1 11), 69871#(<= main_~i~1 14), 69870#(<= main_~i~1 13), 69873#(<= main_~i~1 16), 69872#(<= main_~i~1 15), 69853#true, 69855#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 69854#false] [2018-04-11 13:59:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 111928 backedges. 7104 proven. 5145 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:59:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 13:59:01,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 13:59:01,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:59:01,379 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 21 states. [2018-04-11 13:59:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:01,630 INFO L93 Difference]: Finished difference Result 1032 states and 2005 transitions. [2018-04-11 13:59:01,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:59:01,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1387 [2018-04-11 13:59:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:01,635 INFO L225 Difference]: With dead ends: 1032 [2018-04-11 13:59:01,635 INFO L226 Difference]: Without dead ends: 1032 [2018-04-11 13:59:01,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:59:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-04-11 13:59:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 428. [2018-04-11 13:59:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-11 13:59:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-04-11 13:59:01,649 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 1387 [2018-04-11 13:59:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:01,650 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-04-11 13:59:01,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 13:59:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-04-11 13:59:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2018-04-11 13:59:01,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:01,658 INFO L355 BasicCegarLoop]: trace histogram [207, 185, 185, 185, 185, 185, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:01,658 INFO L408 AbstractCegarLoop]: === Iteration 97 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1937235123, now seen corresponding path program 86 times [2018-04-11 13:59:01,659 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:01,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 113076 backedges. 7730 proven. 5667 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:59:03,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:03,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:59:03,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8397 backedges. 616 proven. 340 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:03,987 INFO L182 omatonBuilderFactory]: Interpolants [71361#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 71360#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 71363#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 71362#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 71365#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 71364#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 71367#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 71366#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 71369#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 71368#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 71371#(<= main_~i~1 11), 71370#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 71373#(<= main_~i~1 13), 71372#(<= main_~i~1 12), 71375#(<= main_~i~1 15), 71374#(<= main_~i~1 14), 71377#(<= main_~i~1 17), 71376#(<= main_~i~1 16), 71357#false, 71356#true, 71359#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 71358#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0))] [2018-04-11 13:59:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 113076 backedges. 7730 proven. 5667 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:59:03,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:59:03,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:59:03,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:59:03,990 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 22 states. [2018-04-11 13:59:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:04,261 INFO L93 Difference]: Finished difference Result 1035 states and 2116 transitions. [2018-04-11 13:59:04,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:59:04,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1393 [2018-04-11 13:59:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:04,266 INFO L225 Difference]: With dead ends: 1035 [2018-04-11 13:59:04,266 INFO L226 Difference]: Without dead ends: 1035 [2018-04-11 13:59:04,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:59:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-04-11 13:59:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 428. [2018-04-11 13:59:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-11 13:59:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 621 transitions. [2018-04-11 13:59:04,281 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 621 transitions. Word has length 1393 [2018-04-11 13:59:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:04,281 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 621 transitions. [2018-04-11 13:59:04,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:59:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 621 transitions. [2018-04-11 13:59:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1400 [2018-04-11 13:59:04,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:04,290 INFO L355 BasicCegarLoop]: trace histogram [208, 186, 186, 186, 186, 186, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:04,290 INFO L408 AbstractCegarLoop]: === Iteration 98 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1224438277, now seen corresponding path program 87 times [2018-04-11 13:59:04,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:04,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 114230 backedges. 8356 proven. 6195 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:59:06,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:06,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:06,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8427 backedges. 616 proven. 370 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:06,614 INFO L182 omatonBuilderFactory]: Interpolants [72865#true, 72867#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 72866#false, 72869#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 72868#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 72871#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 72870#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 72873#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 72872#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 72875#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 72874#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 72877#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 72876#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 72879#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 72878#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 72881#(<= main_~i~1 12), 72880#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 72883#(<= main_~i~1 14), 72882#(<= main_~i~1 13), 72885#(<= main_~i~1 16), 72884#(<= main_~i~1 15), 72887#(<= main_~i~1 18), 72886#(<= main_~i~1 17)] [2018-04-11 13:59:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 114230 backedges. 8356 proven. 6195 refuted. 0 times theorem prover too weak. 99679 trivial. 0 not checked. [2018-04-11 13:59:06,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:06,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:06,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:06,617 INFO L87 Difference]: Start difference. First operand 428 states and 621 transitions. Second operand 23 states. [2018-04-11 13:59:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:06,914 INFO L93 Difference]: Finished difference Result 1035 states and 2116 transitions. [2018-04-11 13:59:06,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:59:06,914 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1399 [2018-04-11 13:59:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:06,919 INFO L225 Difference]: With dead ends: 1035 [2018-04-11 13:59:06,919 INFO L226 Difference]: Without dead ends: 1035 [2018-04-11 13:59:06,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 13:59:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-04-11 13:59:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 425. [2018-04-11 13:59:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 13:59:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-04-11 13:59:06,934 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1399 [2018-04-11 13:59:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:06,935 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-04-11 13:59:06,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-04-11 13:59:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2018-04-11 13:59:06,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:06,943 INFO L355 BasicCegarLoop]: trace histogram [209, 187, 187, 187, 187, 187, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:06,943 INFO L408 AbstractCegarLoop]: === Iteration 99 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 826878275, now seen corresponding path program 88 times [2018-04-11 13:59:06,944 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:07,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 115390 backedges. 9981 proven. 5630 refuted. 0 times theorem prover too weak. 99779 trivial. 0 not checked. [2018-04-11 13:59:09,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:09,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:09,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8460 backedges. 699 proven. 320 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:09,343 INFO L182 omatonBuilderFactory]: Interpolants [74375#false, 74374#true, 74377#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 74376#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 74379#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 74378#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 74381#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 74380#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 74383#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 74382#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 74385#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 74384#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 74387#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 74386#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 74389#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 74388#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 74391#(<= main_~i~1 13), 74390#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13), 74393#(<= main_~i~1 15), 74392#(<= main_~i~1 14), 74395#(<= main_~i~1 17), 74394#(<= main_~i~1 16), 74396#(<= main_~i~1 18)] [2018-04-11 13:59:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 115390 backedges. 9981 proven. 5630 refuted. 0 times theorem prover too weak. 99779 trivial. 0 not checked. [2018-04-11 13:59:09,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:09,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:09,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:09,345 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-04-11 13:59:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:09,643 INFO L93 Difference]: Finished difference Result 972 states and 1963 transitions. [2018-04-11 13:59:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:59:09,643 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1405 [2018-04-11 13:59:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:09,648 INFO L225 Difference]: With dead ends: 972 [2018-04-11 13:59:09,648 INFO L226 Difference]: Without dead ends: 972 [2018-04-11 13:59:09,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=387, Invalid=945, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:59:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-04-11 13:59:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 425. [2018-04-11 13:59:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 13:59:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-04-11 13:59:09,663 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1405 [2018-04-11 13:59:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:09,663 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-04-11 13:59:09,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-04-11 13:59:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-04-11 13:59:09,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:09,672 INFO L355 BasicCegarLoop]: trace histogram [210, 188, 188, 188, 188, 188, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:09,672 INFO L408 AbstractCegarLoop]: === Iteration 100 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1945638347, now seen corresponding path program 89 times [2018-04-11 13:59:09,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:09,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 116556 backedges. 11840 proven. 4831 refuted. 0 times theorem prover too weak. 99885 trivial. 0 not checked. [2018-04-11 13:59:12,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:12,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:12,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8484 backedges. 785 proven. 258 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:12,013 INFO L182 omatonBuilderFactory]: Interpolants [75841#(<= main_~i~1 15), 75840#(<= main_~i~1 14), 75843#(<= main_~i~1 17), 75842#(<= main_~i~1 16), 75844#(<= main_~i~1 18), 75823#false, 75822#true, 75825#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 75824#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 75827#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 75826#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 75829#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 75828#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 75831#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 75830#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 75833#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 75832#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 75835#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 75834#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 75837#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 75836#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 75839#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 14), 75838#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14))] [2018-04-11 13:59:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 116556 backedges. 11840 proven. 4831 refuted. 0 times theorem prover too weak. 99885 trivial. 0 not checked. [2018-04-11 13:59:12,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:12,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:12,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:12,016 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-04-11 13:59:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:12,316 INFO L93 Difference]: Finished difference Result 897 states and 1778 transitions. [2018-04-11 13:59:12,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 13:59:12,316 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1411 [2018-04-11 13:59:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:12,320 INFO L225 Difference]: With dead ends: 897 [2018-04-11 13:59:12,320 INFO L226 Difference]: Without dead ends: 897 [2018-04-11 13:59:12,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:59:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-04-11 13:59:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 425. [2018-04-11 13:59:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 13:59:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-04-11 13:59:12,333 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1411 [2018-04-11 13:59:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:12,334 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-04-11 13:59:12,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-04-11 13:59:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2018-04-11 13:59:12,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:12,342 INFO L355 BasicCegarLoop]: trace histogram [211, 189, 189, 189, 189, 189, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:12,342 INFO L408 AbstractCegarLoop]: === Iteration 101 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash 153875347, now seen corresponding path program 90 times [2018-04-11 13:59:12,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:12,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 117728 backedges. 13951 proven. 3780 refuted. 0 times theorem prover too weak. 99997 trivial. 0 not checked. [2018-04-11 13:59:14,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:14,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:14,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8502 backedges. 877 proven. 184 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:14,736 INFO L182 omatonBuilderFactory]: Interpolants [77217#(<= main_~i~1 16), 77216#(<= main_~i~1 15), 77219#(<= main_~i~1 18), 77218#(<= main_~i~1 17), 77197#true, 77199#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 77198#false, 77201#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 77200#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 77203#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 77202#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 77205#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 77204#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 77207#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 77206#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 77209#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 77208#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 77211#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 77210#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 77213#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 77212#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 77215#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 15), 77214#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15))] [2018-04-11 13:59:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 117728 backedges. 13951 proven. 3780 refuted. 0 times theorem prover too weak. 99997 trivial. 0 not checked. [2018-04-11 13:59:14,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:14,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:14,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:14,739 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-04-11 13:59:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:15,030 INFO L93 Difference]: Finished difference Result 810 states and 1560 transitions. [2018-04-11 13:59:15,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 13:59:15,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1417 [2018-04-11 13:59:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:15,034 INFO L225 Difference]: With dead ends: 810 [2018-04-11 13:59:15,034 INFO L226 Difference]: Without dead ends: 810 [2018-04-11 13:59:15,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=473, Invalid=1009, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:59:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-04-11 13:59:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 425. [2018-04-11 13:59:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 13:59:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-04-11 13:59:15,045 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1417 [2018-04-11 13:59:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:15,045 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-04-11 13:59:15,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-04-11 13:59:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1424 [2018-04-11 13:59:15,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:15,054 INFO L355 BasicCegarLoop]: trace histogram [212, 190, 190, 190, 190, 190, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:15,054 INFO L408 AbstractCegarLoop]: === Iteration 102 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash -96349541, now seen corresponding path program 91 times [2018-04-11 13:59:15,054 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:15,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 118906 backedges. 16332 proven. 2459 refuted. 0 times theorem prover too weak. 100115 trivial. 0 not checked. [2018-04-11 13:59:17,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:17,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:17,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8514 backedges. 975 proven. 98 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:17,476 INFO L182 omatonBuilderFactory]: Interpolants [78497#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 78496#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 78499#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 78498#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 78501#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 78500#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 78503#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 78502#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 78505#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 16)), 78504#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 78507#(<= main_~i~1 16), 78506#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 16), 78509#(<= main_~i~1 18), 78508#(<= main_~i~1 17), 78487#true, 78489#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 78488#false, 78491#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 78490#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 78493#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 78492#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 78495#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 78494#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5))] [2018-04-11 13:59:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 118906 backedges. 16332 proven. 2459 refuted. 0 times theorem prover too weak. 100115 trivial. 0 not checked. [2018-04-11 13:59:17,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:17,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:17,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:17,479 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-04-11 13:59:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:17,747 INFO L93 Difference]: Finished difference Result 715 states and 1312 transitions. [2018-04-11 13:59:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 13:59:17,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1423 [2018-04-11 13:59:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:17,751 INFO L225 Difference]: With dead ends: 715 [2018-04-11 13:59:17,751 INFO L226 Difference]: Without dead ends: 715 [2018-04-11 13:59:17,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=522, Invalid=1038, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:59:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-04-11 13:59:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 425. [2018-04-11 13:59:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-11 13:59:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2018-04-11 13:59:17,763 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 1423 [2018-04-11 13:59:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:17,764 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2018-04-11 13:59:17,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2018-04-11 13:59:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1430 [2018-04-11 13:59:17,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:17,773 INFO L355 BasicCegarLoop]: trace histogram [213, 191, 191, 191, 191, 191, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:17,773 INFO L408 AbstractCegarLoop]: === Iteration 103 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1006292253, now seen corresponding path program 92 times [2018-04-11 13:59:17,773 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:17,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 120090 backedges. 19001 proven. 850 refuted. 0 times theorem prover too weak. 100239 trivial. 0 not checked. [2018-04-11 13:59:20,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:20,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:20,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8520 backedges. 1079 proven. 0 refuted. 0 times theorem prover too weak. 7441 trivial. 0 not checked. [2018-04-11 13:59:20,317 INFO L182 omatonBuilderFactory]: Interpolants [79685#false, 79684#true, 79687#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 79686#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 79689#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 79688#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 79691#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 79690#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 79693#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 79692#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 79695#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 79694#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 79697#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 79696#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 79699#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 79698#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 79701#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 79700#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 79703#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 17)), 79702#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 16)), 79705#(<= main_~i~1 17), 79704#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 17), 79706#(<= main_~i~1 18)] [2018-04-11 13:59:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 120090 backedges. 19001 proven. 850 refuted. 0 times theorem prover too weak. 100239 trivial. 0 not checked. [2018-04-11 13:59:20,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:20,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:20,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:20,320 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand 23 states. [2018-04-11 13:59:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:20,659 INFO L93 Difference]: Finished difference Result 613 states and 1073 transitions. [2018-04-11 13:59:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 13:59:20,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1429 [2018-04-11 13:59:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:20,662 INFO L225 Difference]: With dead ends: 613 [2018-04-11 13:59:20,663 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 13:59:20,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 13:59:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 13:59:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 434. [2018-04-11 13:59:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-11 13:59:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 628 transitions. [2018-04-11 13:59:20,670 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 628 transitions. Word has length 1429 [2018-04-11 13:59:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:20,671 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 628 transitions. [2018-04-11 13:59:20,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 628 transitions. [2018-04-11 13:59:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1436 [2018-04-11 13:59:20,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:20,680 INFO L355 BasicCegarLoop]: trace histogram [214, 192, 192, 192, 192, 192, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:20,680 INFO L408 AbstractCegarLoop]: === Iteration 104 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -493353877, now seen corresponding path program 93 times [2018-04-11 13:59:20,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:20,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 121280 backedges. 3806 proven. 8215 refuted. 0 times theorem prover too weak. 109259 trivial. 0 not checked. [2018-04-11 13:59:23,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:23,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:23,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8517 backedges. 283 proven. 631 refuted. 0 times theorem prover too weak. 7603 trivial. 0 not checked. [2018-04-11 13:59:23,179 INFO L182 omatonBuilderFactory]: Interpolants [80801#(<= 9 main_~i~1), 80800#(<= 8 main_~i~1), 80803#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 80802#(<= 10 main_~i~1), 80805#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 80804#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 80807#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 80806#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 80809#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 80808#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 80811#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 80810#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 80813#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 80812#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 80791#false, 80790#true, 80793#(<= 1 main_~i~1), 80792#(<= 0 main_~i~1), 80795#(<= 3 main_~i~1), 80794#(<= 2 main_~i~1), 80797#(<= 5 main_~i~1), 80796#(<= 4 main_~i~1), 80799#(<= 7 main_~i~1), 80798#(<= 6 main_~i~1)] [2018-04-11 13:59:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 121280 backedges. 3806 proven. 8215 refuted. 0 times theorem prover too weak. 109259 trivial. 0 not checked. [2018-04-11 13:59:23,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:23,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:23,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:23,181 INFO L87 Difference]: Start difference. First operand 434 states and 628 transitions. Second operand 24 states. [2018-04-11 13:59:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:23,653 INFO L93 Difference]: Finished difference Result 487 states and 678 transitions. [2018-04-11 13:59:23,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:59:23,653 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1435 [2018-04-11 13:59:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:23,654 INFO L225 Difference]: With dead ends: 487 [2018-04-11 13:59:23,654 INFO L226 Difference]: Without dead ends: 487 [2018-04-11 13:59:23,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:59:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-04-11 13:59:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 437. [2018-04-11 13:59:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 13:59:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 638 transitions. [2018-04-11 13:59:23,659 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 638 transitions. Word has length 1435 [2018-04-11 13:59:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:23,659 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 638 transitions. [2018-04-11 13:59:23,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 638 transitions. [2018-04-11 13:59:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2018-04-11 13:59:23,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:23,669 INFO L355 BasicCegarLoop]: trace histogram [220, 198, 198, 198, 198, 198, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:23,669 INFO L408 AbstractCegarLoop]: === Iteration 105 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2020762149, now seen corresponding path program 94 times [2018-04-11 13:59:23,669 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:23,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 128546 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 127116 trivial. 0 not checked. [2018-04-11 13:59:26,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:26,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:59:26,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8805 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8805 trivial. 0 not checked. [2018-04-11 13:59:26,211 INFO L182 omatonBuilderFactory]: Interpolants [81759#false, 81758#true, 81761#(<= main_~i~1 1), 81760#(= main_~i~1 0), 81763#(<= main_~i~1 3), 81762#(<= main_~i~1 2), 81765#(<= main_~i~1 5), 81764#(<= main_~i~1 4), 81767#(<= main_~i~1 7), 81766#(<= main_~i~1 6), 81769#(<= main_~i~1 9), 81768#(<= main_~i~1 8), 81771#(<= main_~i~1 11), 81770#(<= main_~i~1 10), 81773#(<= main_~i~1 13), 81772#(<= main_~i~1 12), 81775#(<= main_~i~1 15), 81774#(<= main_~i~1 14), 81777#(<= main_~i~1 17), 81776#(<= main_~i~1 16), 81779#(<= main_~i~1 19), 81778#(<= main_~i~1 18), 81781#(<= main_~i~1 21), 81780#(<= main_~i~1 20), 81782#(<= main_~i~1 22)] [2018-04-11 13:59:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 128546 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 127116 trivial. 0 not checked. [2018-04-11 13:59:26,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:59:26,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:59:26,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:59:26,213 INFO L87 Difference]: Start difference. First operand 437 states and 638 transitions. Second operand 25 states. [2018-04-11 13:59:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:26,402 INFO L93 Difference]: Finished difference Result 740 states and 1109 transitions. [2018-04-11 13:59:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:59:26,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1471 [2018-04-11 13:59:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:26,406 INFO L225 Difference]: With dead ends: 740 [2018-04-11 13:59:26,406 INFO L226 Difference]: Without dead ends: 740 [2018-04-11 13:59:26,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:59:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-04-11 13:59:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 448. [2018-04-11 13:59:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:26,414 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1471 [2018-04-11 13:59:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:26,415 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:26,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:59:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1544 [2018-04-11 13:59:26,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:26,425 INFO L355 BasicCegarLoop]: trace histogram [231, 208, 208, 208, 208, 208, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:26,425 INFO L408 AbstractCegarLoop]: === Iteration 106 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:26,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1005294164, now seen corresponding path program 95 times [2018-04-11 13:59:26,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:26,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 141818 backedges. 7576 proven. 6320 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-04-11 13:59:29,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:29,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:59:29,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9867 backedges. 670 proven. 372 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:29,138 INFO L182 omatonBuilderFactory]: Interpolants [82977#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 82976#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 82979#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 82978#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 82981#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 82980#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 82983#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 82982#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 82985#(<= main_~i~1 10), 82984#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 82987#(<= main_~i~1 12), 82986#(<= main_~i~1 11), 82989#(<= main_~i~1 14), 82988#(<= main_~i~1 13), 82991#(<= main_~i~1 16), 82990#(<= main_~i~1 15), 82992#(<= main_~i~1 17), 82971#true, 82973#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 82972#false, 82975#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 82974#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1))] [2018-04-11 13:59:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 141818 backedges. 7576 proven. 6320 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-04-11 13:59:29,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:59:29,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:59:29,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:59:29,140 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 22 states. [2018-04-11 13:59:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:29,415 INFO L93 Difference]: Finished difference Result 1147 states and 2284 transitions. [2018-04-11 13:59:29,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:59:29,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1543 [2018-04-11 13:59:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:29,421 INFO L225 Difference]: With dead ends: 1147 [2018-04-11 13:59:29,421 INFO L226 Difference]: Without dead ends: 1147 [2018-04-11 13:59:29,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:59:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-04-11 13:59:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 451. [2018-04-11 13:59:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-04-11 13:59:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 680 transitions. [2018-04-11 13:59:29,437 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 680 transitions. Word has length 1543 [2018-04-11 13:59:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:29,437 INFO L459 AbstractCegarLoop]: Abstraction has 451 states and 680 transitions. [2018-04-11 13:59:29,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:59:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 680 transitions. [2018-04-11 13:59:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1550 [2018-04-11 13:59:29,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:29,461 INFO L355 BasicCegarLoop]: trace histogram [232, 209, 209, 209, 209, 209, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:29,461 INFO L408 AbstractCegarLoop]: === Iteration 107 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1313614068, now seen corresponding path program 96 times [2018-04-11 13:59:29,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:29,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 143112 backedges. 8238 proven. 6952 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-04-11 13:59:32,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:32,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:59:32,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9885 backedges. 652 proven. 408 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:32,267 INFO L182 omatonBuilderFactory]: Interpolants [84613#true, 84615#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 84614#false, 84617#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 84616#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 84619#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 84618#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 84621#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 84620#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 84623#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 84622#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 84625#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 84624#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 84627#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 84626#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 84629#(<= main_~i~1 12), 84628#(<= main_~i~1 11), 84631#(<= main_~i~1 14), 84630#(<= main_~i~1 13), 84633#(<= main_~i~1 16), 84632#(<= main_~i~1 15), 84635#(<= main_~i~1 18), 84634#(<= main_~i~1 17)] [2018-04-11 13:59:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 143112 backedges. 8238 proven. 6952 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-04-11 13:59:32,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:59:32,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:59:32,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:59:32,270 INFO L87 Difference]: Start difference. First operand 451 states and 680 transitions. Second operand 23 states. [2018-04-11 13:59:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:32,558 INFO L93 Difference]: Finished difference Result 1150 states and 2411 transitions. [2018-04-11 13:59:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:59:32,558 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1549 [2018-04-11 13:59:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:32,564 INFO L225 Difference]: With dead ends: 1150 [2018-04-11 13:59:32,564 INFO L226 Difference]: Without dead ends: 1150 [2018-04-11 13:59:32,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:59:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-04-11 13:59:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 451. [2018-04-11 13:59:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-04-11 13:59:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 680 transitions. [2018-04-11 13:59:32,580 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 680 transitions. Word has length 1549 [2018-04-11 13:59:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:32,580 INFO L459 AbstractCegarLoop]: Abstraction has 451 states and 680 transitions. [2018-04-11 13:59:32,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:59:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 680 transitions. [2018-04-11 13:59:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1556 [2018-04-11 13:59:32,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:32,590 INFO L355 BasicCegarLoop]: trace histogram [233, 210, 210, 210, 210, 210, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:32,590 INFO L408 AbstractCegarLoop]: === Iteration 108 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash 558648892, now seen corresponding path program 97 times [2018-04-11 13:59:32,591 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:32,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 144412 backedges. 8900 proven. 7590 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-04-11 13:59:35,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:35,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:35,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9921 backedges. 652 proven. 444 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:35,639 INFO L182 omatonBuilderFactory]: Interpolants [86273#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 86272#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 86275#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 86274#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 86277#(<= main_~i~1 12), 86276#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 86279#(<= main_~i~1 14), 86278#(<= main_~i~1 13), 86281#(<= main_~i~1 16), 86280#(<= main_~i~1 15), 86283#(<= main_~i~1 18), 86282#(<= main_~i~1 17), 86284#(<= main_~i~1 19), 86261#true, 86263#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 86262#false, 86265#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 86264#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 86267#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 86266#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 86269#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 86268#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 86271#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 86270#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7))] [2018-04-11 13:59:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 144412 backedges. 8900 proven. 7590 refuted. 0 times theorem prover too weak. 127922 trivial. 0 not checked. [2018-04-11 13:59:35,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:35,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:35,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:35,642 INFO L87 Difference]: Start difference. First operand 451 states and 680 transitions. Second operand 24 states. [2018-04-11 13:59:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:35,951 INFO L93 Difference]: Finished difference Result 1150 states and 2411 transitions. [2018-04-11 13:59:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:59:35,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1555 [2018-04-11 13:59:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:35,957 INFO L225 Difference]: With dead ends: 1150 [2018-04-11 13:59:35,957 INFO L226 Difference]: Without dead ends: 1150 [2018-04-11 13:59:35,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:59:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-04-11 13:59:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 448. [2018-04-11 13:59:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:35,975 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1555 [2018-04-11 13:59:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:35,975 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:35,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1562 [2018-04-11 13:59:35,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:35,985 INFO L355 BasicCegarLoop]: trace histogram [234, 211, 211, 211, 211, 211, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:35,985 INFO L408 AbstractCegarLoop]: === Iteration 109 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -610443900, now seen corresponding path program 98 times [2018-04-11 13:59:35,986 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:36,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 145718 backedges. 10567 proven. 7129 refuted. 0 times theorem prover too weak. 128022 trivial. 0 not checked. [2018-04-11 13:59:38,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:38,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:38,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9960 backedges. 735 proven. 400 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:38,981 INFO L182 omatonBuilderFactory]: Interpolants [87909#true, 87911#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 87910#false, 87913#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 87912#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 87915#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 87914#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 87917#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 87916#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 87919#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 87918#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 87921#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 87920#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 87923#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 87922#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 87925#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13), 87924#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 87927#(<= main_~i~1 14), 87926#(<= main_~i~1 13), 87929#(<= main_~i~1 16), 87928#(<= main_~i~1 15), 87931#(<= main_~i~1 18), 87930#(<= main_~i~1 17), 87932#(<= main_~i~1 19)] [2018-04-11 13:59:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 145718 backedges. 10567 proven. 7129 refuted. 0 times theorem prover too weak. 128022 trivial. 0 not checked. [2018-04-11 13:59:38,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:38,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:38,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:38,985 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-04-11 13:59:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:39,318 INFO L93 Difference]: Finished difference Result 1093 states and 2273 transitions. [2018-04-11 13:59:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 13:59:39,318 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1561 [2018-04-11 13:59:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:39,324 INFO L225 Difference]: With dead ends: 1093 [2018-04-11 13:59:39,324 INFO L226 Difference]: Without dead ends: 1093 [2018-04-11 13:59:39,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 13:59:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-04-11 13:59:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 448. [2018-04-11 13:59:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:39,340 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1561 [2018-04-11 13:59:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:39,340 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:39,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2018-04-11 13:59:39,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:39,356 INFO L355 BasicCegarLoop]: trace histogram [235, 212, 212, 212, 212, 212, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:39,356 INFO L408 AbstractCegarLoop]: === Iteration 110 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1165557260, now seen corresponding path program 99 times [2018-04-11 13:59:39,357 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:39,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 147030 backedges. 12468 proven. 6434 refuted. 0 times theorem prover too weak. 128128 trivial. 0 not checked. [2018-04-11 13:59:42,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:42,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:42,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 821 proven. 344 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:42,355 INFO L182 omatonBuilderFactory]: Interpolants [89505#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 89504#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 89507#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 89506#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 89509#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 89508#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 89511#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 89510#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 89513#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 89512#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 89515#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 89514#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 89517#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 89516#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 89519#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 14), 89518#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 89521#(<= main_~i~1 15), 89520#(<= main_~i~1 14), 89523#(<= main_~i~1 17), 89522#(<= main_~i~1 16), 89525#(<= main_~i~1 19), 89524#(<= main_~i~1 18), 89503#false, 89502#true] [2018-04-11 13:59:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 147030 backedges. 12468 proven. 6434 refuted. 0 times theorem prover too weak. 128128 trivial. 0 not checked. [2018-04-11 13:59:42,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:42,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:42,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:42,358 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-04-11 13:59:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:42,684 INFO L93 Difference]: Finished difference Result 1024 states and 2103 transitions. [2018-04-11 13:59:42,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 13:59:42,684 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1567 [2018-04-11 13:59:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:42,689 INFO L225 Difference]: With dead ends: 1024 [2018-04-11 13:59:42,689 INFO L226 Difference]: Without dead ends: 1024 [2018-04-11 13:59:42,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 13:59:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2018-04-11 13:59:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 448. [2018-04-11 13:59:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:42,704 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1567 [2018-04-11 13:59:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:42,704 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:42,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1574 [2018-04-11 13:59:42,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:42,714 INFO L355 BasicCegarLoop]: trace histogram [236, 213, 213, 213, 213, 213, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:42,714 INFO L408 AbstractCegarLoop]: === Iteration 111 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1683607508, now seen corresponding path program 100 times [2018-04-11 13:59:42,715 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:42,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 148348 backedges. 14621 proven. 5487 refuted. 0 times theorem prover too weak. 128240 trivial. 0 not checked. [2018-04-11 13:59:45,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:45,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:45,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10014 backedges. 913 proven. 276 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:45,774 INFO L182 omatonBuilderFactory]: Interpolants [91041#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 91040#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 91043#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 91042#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 91045#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 91044#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 91047#(<= main_~i~1 15), 91046#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 15), 91049#(<= main_~i~1 17), 91048#(<= main_~i~1 16), 91051#(<= main_~i~1 19), 91050#(<= main_~i~1 18), 91029#false, 91028#true, 91031#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 91030#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 91033#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 91032#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 91035#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 91034#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 91037#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 91036#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 91039#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 91038#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8))] [2018-04-11 13:59:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 148348 backedges. 14621 proven. 5487 refuted. 0 times theorem prover too weak. 128240 trivial. 0 not checked. [2018-04-11 13:59:45,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:45,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:45,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:45,777 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-04-11 13:59:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:46,082 INFO L93 Difference]: Finished difference Result 943 states and 1900 transitions. [2018-04-11 13:59:46,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 13:59:46,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1573 [2018-04-11 13:59:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:46,087 INFO L225 Difference]: With dead ends: 943 [2018-04-11 13:59:46,087 INFO L226 Difference]: Without dead ends: 943 [2018-04-11 13:59:46,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=479, Invalid=1081, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:59:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-04-11 13:59:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 448. [2018-04-11 13:59:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:46,099 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1573 [2018-04-11 13:59:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:46,100 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:46,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2018-04-11 13:59:46,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:46,110 INFO L355 BasicCegarLoop]: trace histogram [237, 214, 214, 214, 214, 214, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:46,110 INFO L408 AbstractCegarLoop]: === Iteration 112 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2003624668, now seen corresponding path program 101 times [2018-04-11 13:59:46,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:46,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 149672 backedges. 17044 proven. 4270 refuted. 0 times theorem prover too weak. 128358 trivial. 0 not checked. [2018-04-11 13:59:49,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:49,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:49,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10032 backedges. 1011 proven. 196 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:49,037 INFO L182 omatonBuilderFactory]: Interpolants [92481#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 92480#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 92483#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 92482#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 92485#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 92484#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 92487#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 92486#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 92489#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 92488#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 92491#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 92490#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 92493#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 16)), 92492#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 92495#(<= main_~i~1 16), 92494#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 16), 92497#(<= main_~i~1 18), 92496#(<= main_~i~1 17), 92498#(<= main_~i~1 19), 92475#true, 92477#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 92476#false, 92479#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 92478#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1))] [2018-04-11 13:59:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 149672 backedges. 17044 proven. 4270 refuted. 0 times theorem prover too weak. 128358 trivial. 0 not checked. [2018-04-11 13:59:49,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:49,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:49,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:49,040 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-04-11 13:59:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:49,384 INFO L93 Difference]: Finished difference Result 850 states and 1663 transitions. [2018-04-11 13:59:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 13:59:49,384 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1579 [2018-04-11 13:59:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:49,387 INFO L225 Difference]: With dead ends: 850 [2018-04-11 13:59:49,387 INFO L226 Difference]: Without dead ends: 850 [2018-04-11 13:59:49,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=527, Invalid=1113, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 13:59:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-04-11 13:59:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 448. [2018-04-11 13:59:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:49,397 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1579 [2018-04-11 13:59:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:49,397 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:49,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1586 [2018-04-11 13:59:49,406 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:49,406 INFO L355 BasicCegarLoop]: trace histogram [238, 215, 215, 215, 215, 215, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:49,406 INFO L408 AbstractCegarLoop]: === Iteration 113 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash 398309156, now seen corresponding path program 102 times [2018-04-11 13:59:49,407 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:49,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 151002 backedges. 19755 proven. 2765 refuted. 0 times theorem prover too weak. 128482 trivial. 0 not checked. [2018-04-11 13:59:52,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:52,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:52,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10044 backedges. 1115 proven. 104 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:52,336 INFO L182 omatonBuilderFactory]: Interpolants [93831#true, 93833#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 93832#false, 93835#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 93834#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 93837#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 93836#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 93839#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 93838#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 93841#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 93840#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 93843#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 93842#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 93845#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 93844#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 93847#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 93846#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 93849#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 16)), 93848#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 93851#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 17), 93850#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 17)), 93853#(<= main_~i~1 18), 93852#(<= main_~i~1 17), 93854#(<= main_~i~1 19)] [2018-04-11 13:59:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 151002 backedges. 19755 proven. 2765 refuted. 0 times theorem prover too weak. 128482 trivial. 0 not checked. [2018-04-11 13:59:52,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:52,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:52,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=351, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:52,339 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-04-11 13:59:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:52,675 INFO L93 Difference]: Finished difference Result 749 states and 1395 transitions. [2018-04-11 13:59:52,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 13:59:52,675 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1585 [2018-04-11 13:59:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:52,679 INFO L225 Difference]: With dead ends: 749 [2018-04-11 13:59:52,679 INFO L226 Difference]: Without dead ends: 749 [2018-04-11 13:59:52,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=579, Invalid=1143, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:59:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-04-11 13:59:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 448. [2018-04-11 13:59:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-11 13:59:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 657 transitions. [2018-04-11 13:59:52,687 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 657 transitions. Word has length 1585 [2018-04-11 13:59:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:52,688 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 657 transitions. [2018-04-11 13:59:52,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 657 transitions. [2018-04-11 13:59:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1592 [2018-04-11 13:59:52,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:52,698 INFO L355 BasicCegarLoop]: trace histogram [239, 216, 216, 216, 216, 216, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:52,698 INFO L408 AbstractCegarLoop]: === Iteration 114 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1407304532, now seen corresponding path program 103 times [2018-04-11 13:59:52,698 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:52,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 152338 backedges. 22772 proven. 954 refuted. 0 times theorem prover too weak. 128612 trivial. 0 not checked. [2018-04-11 13:59:55,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:55,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:59:55,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 1225 proven. 0 refuted. 0 times theorem prover too weak. 8825 trivial. 0 not checked. [2018-04-11 13:59:55,714 INFO L182 omatonBuilderFactory]: Interpolants [95105#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 95104#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 95107#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 17)), 95106#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 16)), 95109#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 18), 95108#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 18)), 95111#(<= main_~i~1 19), 95110#(<= main_~i~1 18), 95089#false, 95088#true, 95091#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 95090#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 95093#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 95092#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 95095#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 95094#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 95097#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 95096#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 95099#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 95098#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 95101#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 95100#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 95103#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 95102#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12))] [2018-04-11 13:59:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 152338 backedges. 22772 proven. 954 refuted. 0 times theorem prover too weak. 128612 trivial. 0 not checked. [2018-04-11 13:59:55,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:59:55,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:59:55,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:59:55,718 INFO L87 Difference]: Start difference. First operand 448 states and 657 transitions. Second operand 24 states. [2018-04-11 13:59:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:56,015 INFO L93 Difference]: Finished difference Result 641 states and 1137 transitions. [2018-04-11 13:59:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 13:59:56,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1591 [2018-04-11 13:59:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:56,018 INFO L225 Difference]: With dead ends: 641 [2018-04-11 13:59:56,018 INFO L226 Difference]: Without dead ends: 641 [2018-04-11 13:59:56,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 13:59:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-04-11 13:59:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 457. [2018-04-11 13:59:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-11 13:59:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 687 transitions. [2018-04-11 13:59:56,026 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 687 transitions. Word has length 1591 [2018-04-11 13:59:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:56,026 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 687 transitions. [2018-04-11 13:59:56,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:59:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 687 transitions. [2018-04-11 13:59:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1598 [2018-04-11 13:59:56,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:56,037 INFO L355 BasicCegarLoop]: trace histogram [240, 217, 217, 217, 217, 217, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:56,037 INFO L408 AbstractCegarLoop]: === Iteration 115 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash 885707636, now seen corresponding path program 104 times [2018-04-11 13:59:56,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:56,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:59:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 153680 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 152116 trivial. 0 not checked. [2018-04-11 13:59:59,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:59:59,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:59:59,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:59:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10047 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2018-04-11 13:59:59,095 INFO L182 omatonBuilderFactory]: Interpolants [96257#(<= main_~i~1 7), 96256#(<= main_~i~1 6), 96259#(<= main_~i~1 9), 96258#(<= main_~i~1 8), 96261#(<= main_~i~1 11), 96260#(<= main_~i~1 10), 96263#(<= main_~i~1 13), 96262#(<= main_~i~1 12), 96265#(<= main_~i~1 15), 96264#(<= main_~i~1 14), 96267#(<= main_~i~1 17), 96266#(<= main_~i~1 16), 96269#(<= main_~i~1 19), 96268#(<= main_~i~1 18), 96271#(<= main_~i~1 21), 96270#(<= main_~i~1 20), 96273#(<= main_~i~1 23), 96272#(<= main_~i~1 22), 96249#false, 96248#true, 96251#(<= main_~i~1 1), 96250#(= main_~i~1 0), 96253#(<= main_~i~1 3), 96252#(<= main_~i~1 2), 96255#(<= main_~i~1 5), 96254#(<= main_~i~1 4)] [2018-04-11 13:59:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 153680 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 152116 trivial. 0 not checked. [2018-04-11 13:59:59,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 13:59:59,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 13:59:59,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:59:59,098 INFO L87 Difference]: Start difference. First operand 457 states and 687 transitions. Second operand 26 states. [2018-04-11 13:59:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:59:59,257 INFO L93 Difference]: Finished difference Result 815 states and 1303 transitions. [2018-04-11 13:59:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:59:59,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1597 [2018-04-11 13:59:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:59:59,261 INFO L225 Difference]: With dead ends: 815 [2018-04-11 13:59:59,261 INFO L226 Difference]: Without dead ends: 815 [2018-04-11 13:59:59,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:59:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-04-11 13:59:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 468. [2018-04-11 13:59:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 13:59:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-04-11 13:59:59,269 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1597 [2018-04-11 13:59:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:59:59,269 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-04-11 13:59:59,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 13:59:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-04-11 13:59:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2018-04-11 13:59:59,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:59:59,281 INFO L355 BasicCegarLoop]: trace histogram [251, 227, 227, 227, 227, 227, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:59:59,281 INFO L408 AbstractCegarLoop]: === Iteration 116 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 13:59:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash -396143739, now seen corresponding path program 105 times [2018-04-11 13:59:59,282 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:59:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:59:59,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 168162 backedges. 7676 proven. 7563 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-04-11 14:00:02,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:00:02,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 14:00:02,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:00:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11172 backedges. 670 proven. 434 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-04-11 14:00:02,710 INFO L182 omatonBuilderFactory]: Interpolants [97569#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 97568#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 97571#(<= main_~i~1 10), 97570#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 10), 97573#(<= main_~i~1 12), 97572#(<= main_~i~1 11), 97575#(<= main_~i~1 14), 97574#(<= main_~i~1 13), 97577#(<= main_~i~1 16), 97576#(<= main_~i~1 15), 97579#(<= main_~i~1 18), 97578#(<= main_~i~1 17), 97557#true, 97559#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 97558#false, 97561#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 97560#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 97563#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 97562#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 97565#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 97564#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 97567#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 97566#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7))] [2018-04-11 14:00:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 168162 backedges. 7676 proven. 7563 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-04-11 14:00:02,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 14:00:02,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 14:00:02,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-04-11 14:00:02,714 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 23 states. [2018-04-11 14:00:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:00:02,963 INFO L93 Difference]: Finished difference Result 1262 states and 2668 transitions. [2018-04-11 14:00:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 14:00:02,963 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1669 [2018-04-11 14:00:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:00:02,969 INFO L225 Difference]: With dead ends: 1262 [2018-04-11 14:00:02,969 INFO L226 Difference]: Without dead ends: 1262 [2018-04-11 14:00:02,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 14:00:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-04-11 14:00:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 471. [2018-04-11 14:00:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 14:00:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 731 transitions. [2018-04-11 14:00:02,987 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 731 transitions. Word has length 1669 [2018-04-11 14:00:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:00:02,987 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 731 transitions. [2018-04-11 14:00:02,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 14:00:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 731 transitions. [2018-04-11 14:00:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1676 [2018-04-11 14:00:02,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:00:02,998 INFO L355 BasicCegarLoop]: trace histogram [252, 228, 228, 228, 228, 228, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:00:02,998 INFO L408 AbstractCegarLoop]: === Iteration 117 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 14:00:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash -62603059, now seen corresponding path program 106 times [2018-04-11 14:00:02,999 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:00:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:00:03,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 169572 backedges. 8338 proven. 8311 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-04-11 14:00:06,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:00:06,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 14:00:06,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:00:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11196 backedges. 652 proven. 476 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-04-11 14:00:06,363 INFO L182 omatonBuilderFactory]: Interpolants [99335#true, 99337#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 99336#false, 99339#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 99338#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 99341#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 99340#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 99343#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 99342#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 99345#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 99344#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 99347#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 99346#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 99349#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 11), 99348#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 99351#(<= main_~i~1 12), 99350#(<= main_~i~1 11), 99353#(<= main_~i~1 14), 99352#(<= main_~i~1 13), 99355#(<= main_~i~1 16), 99354#(<= main_~i~1 15), 99357#(<= main_~i~1 18), 99356#(<= main_~i~1 17), 99358#(<= main_~i~1 19)] [2018-04-11 14:00:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 169572 backedges. 8338 proven. 8311 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-04-11 14:00:06,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 14:00:06,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 14:00:06,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2018-04-11 14:00:06,366 INFO L87 Difference]: Start difference. First operand 471 states and 731 transitions. Second operand 24 states. [2018-04-11 14:00:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:00:06,686 INFO L93 Difference]: Finished difference Result 1265 states and 2811 transitions. [2018-04-11 14:00:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 14:00:06,686 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1675 [2018-04-11 14:00:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:00:06,693 INFO L225 Difference]: With dead ends: 1265 [2018-04-11 14:00:06,693 INFO L226 Difference]: Without dead ends: 1265 [2018-04-11 14:00:06,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 14:00:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-04-11 14:00:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 471. [2018-04-11 14:00:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 14:00:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 731 transitions. [2018-04-11 14:00:06,712 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 731 transitions. Word has length 1675 [2018-04-11 14:00:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:00:06,712 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 731 transitions. [2018-04-11 14:00:06,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 14:00:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 731 transitions. [2018-04-11 14:00:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1682 [2018-04-11 14:00:06,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:00:06,723 INFO L355 BasicCegarLoop]: trace histogram [253, 229, 229, 229, 229, 229, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:00:06,723 INFO L408 AbstractCegarLoop]: === Iteration 118 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 14:00:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash -882829291, now seen corresponding path program 107 times [2018-04-11 14:00:06,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:00:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:00:06,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 170988 backedges. 9000 proven. 9065 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-04-11 14:00:10,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:00:10,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 14:00:10,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:00:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11238 backedges. 652 proven. 518 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-04-11 14:00:10,186 INFO L182 omatonBuilderFactory]: Interpolants [101121#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 101120#false, 101123#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 101122#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 101125#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 101124#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 101127#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 101126#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 101129#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 101128#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 101131#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 101130#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 101133#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 101132#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 101135#(<= main_~i~1 12), 101134#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 12), 101137#(<= main_~i~1 14), 101136#(<= main_~i~1 13), 101139#(<= main_~i~1 16), 101138#(<= main_~i~1 15), 101141#(<= main_~i~1 18), 101140#(<= main_~i~1 17), 101143#(<= main_~i~1 20), 101142#(<= main_~i~1 19), 101119#true] [2018-04-11 14:00:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 170988 backedges. 9000 proven. 9065 refuted. 0 times theorem prover too weak. 152923 trivial. 0 not checked. [2018-04-11 14:00:10,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 14:00:10,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 14:00:10,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2018-04-11 14:00:10,190 INFO L87 Difference]: Start difference. First operand 471 states and 731 transitions. Second operand 25 states. [2018-04-11 14:00:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:00:10,527 INFO L93 Difference]: Finished difference Result 1265 states and 2811 transitions. [2018-04-11 14:00:10,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 14:00:10,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1681 [2018-04-11 14:00:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:00:10,534 INFO L225 Difference]: With dead ends: 1265 [2018-04-11 14:00:10,534 INFO L226 Difference]: Without dead ends: 1265 [2018-04-11 14:00:10,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:00:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-04-11 14:00:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 468. [2018-04-11 14:00:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 14:00:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-04-11 14:00:10,554 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1681 [2018-04-11 14:00:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:00:10,554 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-04-11 14:00:10,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 14:00:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-04-11 14:00:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1688 [2018-04-11 14:00:10,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:00:10,565 INFO L355 BasicCegarLoop]: trace histogram [254, 230, 230, 230, 230, 230, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:00:10,566 INFO L408 AbstractCegarLoop]: === Iteration 119 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 14:00:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash -194979491, now seen corresponding path program 108 times [2018-04-11 14:00:10,566 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:00:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:00:10,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 172410 backedges. 10673 proven. 8714 refuted. 0 times theorem prover too weak. 153023 trivial. 0 not checked. [2018-04-11 14:00:14,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:00:14,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 14:00:14,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:00:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11283 backedges. 735 proven. 480 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-04-11 14:00:14,036 INFO L182 omatonBuilderFactory]: Interpolants [102913#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 102912#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 102915#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 102914#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 102917#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 102916#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 102919#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 13), 102918#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 102921#(<= main_~i~1 14), 102920#(<= main_~i~1 13), 102923#(<= main_~i~1 16), 102922#(<= main_~i~1 15), 102925#(<= main_~i~1 18), 102924#(<= main_~i~1 17), 102927#(<= main_~i~1 20), 102926#(<= main_~i~1 19), 102903#true, 102905#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 102904#false, 102907#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 102906#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 102909#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 102908#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 102911#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 102910#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5))] [2018-04-11 14:00:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 172410 backedges. 10673 proven. 8714 refuted. 0 times theorem prover too weak. 153023 trivial. 0 not checked. [2018-04-11 14:00:14,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 14:00:14,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 14:00:14,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-04-11 14:00:14,040 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-04-11 14:00:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:00:14,340 INFO L93 Difference]: Finished difference Result 1214 states and 2681 transitions. [2018-04-11 14:00:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 14:00:14,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1687 [2018-04-11 14:00:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:00:14,346 INFO L225 Difference]: With dead ends: 1214 [2018-04-11 14:00:14,346 INFO L226 Difference]: Without dead ends: 1214 [2018-04-11 14:00:14,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=404, Invalid=1078, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 14:00:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-04-11 14:00:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 468. [2018-04-11 14:00:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 14:00:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-04-11 14:00:14,364 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1687 [2018-04-11 14:00:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:00:14,365 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-04-11 14:00:14,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 14:00:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-04-11 14:00:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1694 [2018-04-11 14:00:14,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:00:14,376 INFO L355 BasicCegarLoop]: trace histogram [255, 231, 231, 231, 231, 231, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:00:14,376 INFO L408 AbstractCegarLoop]: === Iteration 120 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 14:00:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1517650971, now seen corresponding path program 109 times [2018-04-11 14:00:14,376 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:00:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:00:14,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 173838 backedges. 12580 proven. 8129 refuted. 0 times theorem prover too weak. 153129 trivial. 0 not checked. [2018-04-11 14:00:17,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:00:17,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 14:00:17,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:00:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11319 backedges. 821 proven. 430 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-04-11 14:00:17,875 INFO L182 omatonBuilderFactory]: Interpolants [104641#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 104640#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 104643#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 104642#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 104645#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 104644#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 104647#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 104646#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 104649#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 104648#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 104651#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 104650#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 104653#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 104652#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 104655#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 14), 104654#(<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 104657#(<= main_~i~1 15), 104656#(<= main_~i~1 14), 104659#(<= main_~i~1 17), 104658#(<= main_~i~1 16), 104661#(<= main_~i~1 19), 104660#(<= main_~i~1 18), 104662#(<= main_~i~1 20), 104639#false, 104638#true] [2018-04-11 14:00:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 173838 backedges. 12580 proven. 8129 refuted. 0 times theorem prover too weak. 153129 trivial. 0 not checked. [2018-04-11 14:00:17,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 14:00:17,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 14:00:17,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-04-11 14:00:17,879 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-04-11 14:00:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:00:18,218 INFO L93 Difference]: Finished difference Result 1151 states and 2518 transitions. [2018-04-11 14:00:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 14:00:18,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1693 [2018-04-11 14:00:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:00:18,224 INFO L225 Difference]: With dead ends: 1151 [2018-04-11 14:00:18,225 INFO L226 Difference]: Without dead ends: 1151 [2018-04-11 14:00:18,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1117, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 14:00:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-04-11 14:00:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 468. [2018-04-11 14:00:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 14:00:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-04-11 14:00:18,242 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1693 [2018-04-11 14:00:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:00:18,243 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-04-11 14:00:18,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 14:00:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-04-11 14:00:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1700 [2018-04-11 14:00:18,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:00:18,254 INFO L355 BasicCegarLoop]: trace histogram [256, 232, 232, 232, 232, 232, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:00:18,254 INFO L408 AbstractCegarLoop]: === Iteration 121 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 14:00:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2021695405, now seen corresponding path program 110 times [2018-04-11 14:00:18,255 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:00:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:00:18,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 175272 backedges. 14739 proven. 7292 refuted. 0 times theorem prover too weak. 153241 trivial. 0 not checked. [2018-04-11 14:00:21,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:00:21,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 14:00:21,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:00:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11349 backedges. 913 proven. 368 refuted. 0 times theorem prover too weak. 10068 trivial. 0 not checked. [2018-04-11 14:00:21,808 INFO L182 omatonBuilderFactory]: Interpolants [106313#false, 106312#true, 106315#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 106314#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)), 106317#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 3)), 106316#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 2)), 106319#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 5)), 106318#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 4)), 106321#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 7)), 106320#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 6)), 106323#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 9)), 106322#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 8)), 106325#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 11)), 106324#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 10)), 106327#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 13)), 106326#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 12)), 106329#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 15)), 106328#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 14)), 106331#(<= main_~i~1 15), 106330#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 15), 106333#(<= main_~i~1 17), 106332#(<= main_~i~1 16), 106335#(<= main_~i~1 19), 106334#(<= main_~i~1 18), 106336#(<= main_~i~1 20)] [2018-04-11 14:00:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 175272 backedges. 14739 proven. 7292 refuted. 0 times theorem prover too weak. 153241 trivial. 0 not checked. [2018-04-11 14:00:21,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 14:00:21,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 14:00:21,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2018-04-11 14:00:21,811 INFO L87 Difference]: Start difference. First operand 468 states and 707 transitions. Second operand 25 states. [2018-04-11 14:00:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:00:22,153 INFO L93 Difference]: Finished difference Result 1076 states and 2321 transitions. [2018-04-11 14:00:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 14:00:22,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1699 [2018-04-11 14:00:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:00:22,159 INFO L225 Difference]: With dead ends: 1076 [2018-04-11 14:00:22,159 INFO L226 Difference]: Without dead ends: 1076 [2018-04-11 14:00:22,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=1154, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 14:00:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-04-11 14:00:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 468. [2018-04-11 14:00:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 14:00:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 707 transitions. [2018-04-11 14:00:22,174 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 707 transitions. Word has length 1699 [2018-04-11 14:00:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:00:22,175 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 707 transitions. [2018-04-11 14:00:22,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 14:00:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 707 transitions. [2018-04-11 14:00:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1706 [2018-04-11 14:00:22,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:00:22,186 INFO L355 BasicCegarLoop]: trace histogram [257, 233, 233, 233, 233, 233, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:00:22,187 INFO L408 AbstractCegarLoop]: === Iteration 122 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 14:00:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1821092683, now seen corresponding path program 111 times [2018-04-11 14:00:22,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-04-11 14:00:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:00:22,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:00:22,384 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-11 14:00:22,387 INFO L168 Benchmark]: Toolchain (without parser) took 172195.54 ms. Allocated memory was 402.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 340.6 MB in the beginning and 378.5 MB in the end (delta: -37.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-11 14:00:22,388 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:00:22,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.57 ms. Allocated memory is still 402.7 MB. Free memory was 339.3 MB in the beginning and 328.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-11 14:00:22,388 INFO L168 Benchmark]: Boogie Preprocessor took 23.26 ms. Allocated memory is still 402.7 MB. Free memory is still 328.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:00:22,388 INFO L168 Benchmark]: RCFGBuilder took 239.24 ms. Allocated memory was 402.7 MB in the beginning and 593.5 MB in the end (delta: 190.8 MB). Free memory was 328.6 MB in the beginning and 558.6 MB in the end (delta: -230.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:00:22,388 INFO L168 Benchmark]: TraceAbstraction took 171790.43 ms. Allocated memory was 593.5 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 555.9 MB in the beginning and 378.5 MB in the end (delta: 177.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-11 14:00:22,390 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.13 ms. Allocated memory is still 402.7 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 139.57 ms. Allocated memory is still 402.7 MB. Free memory was 339.3 MB in the beginning and 328.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.26 ms. Allocated memory is still 402.7 MB. Free memory is still 328.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 239.24 ms. Allocated memory was 402.7 MB in the beginning and 593.5 MB in the end (delta: 190.8 MB). Free memory was 328.6 MB in the beginning and 558.6 MB in the end (delta: -230.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 171790.43 ms. Allocated memory was 593.5 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 555.9 MB in the beginning and 378.5 MB in the end (delta: 177.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: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-00-22-398.csv Completed graceful shutdown