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/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 04:46:18,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 04:46:18,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 04:46:18,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 04:46:18,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 04:46:18,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 04:46:18,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 04:46:18,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 04:46:18,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 04:46:18,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 04:46:18,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 04:46:18,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 04:46:18,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 04:46:18,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 04:46:18,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 04:46:18,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 04:46:18,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 04:46:18,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 04:46:18,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 04:46:18,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 04:46:18,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 04:46:18,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 04:46:18,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 04:46:18,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 04:46:18,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 04:46:18,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 04:46:18,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 04:46:18,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 04:46:18,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 04:46:18,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 04:46:18,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 04:46:18,797 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-12 04:46:18,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 04:46:18,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 04:46:18,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 04:46:18,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 04:46:18,820 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 04:46:18,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 04:46:18,821 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 04:46:18,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 04:46:18,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 04:46:18,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 04:46:18,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 04:46:18,861 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 04:46:18,864 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 04:46:18,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 04:46:18,866 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 04:46:18,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 04:46:19,145 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG148188390 [2018-04-12 04:46:19,292 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 04:46:19,292 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 04:46:19,292 INFO L168 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 04:46:19,293 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 04:46:19,293 INFO L215 ultiparseSymbolTable]: [2018-04-12 04:46:19,293 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 04:46:19,293 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 04:46:19,293 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 04:46:19,293 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 04:46:19,293 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 04:46:19,293 INFO L233 ultiparseSymbolTable]: [2018-04-12 04:46:19,305 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG148188390 [2018-04-12 04:46:19,309 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 04:46:19,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 04:46:19,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 04:46:19,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 04:46:19,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 04:46:19,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c1bde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19, skipping insertion in model container [2018-04-12 04:46:19,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,328 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 04:46:19,338 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 04:46:19,445 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 04:46:19,466 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 04:46:19,469 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-04-12 04:46:19,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19 WrapperNode [2018-04-12 04:46:19,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 04:46:19,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 04:46:19,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 04:46:19,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 04:46:19,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... [2018-04-12 04:46:19,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 04:46:19,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 04:46:19,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 04:46:19,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 04:46:19,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 04:46:19,545 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 04:46:19,545 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 04:46:19,545 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-12 04:46:19,545 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-12 04:46:19,545 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 04:46:19,545 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 04:46:19,546 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 04:46:19,546 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 04:46:19,546 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 04:46:19,803 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 04:46:19,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 04:46:19 BoogieIcfgContainer [2018-04-12 04:46:19,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 04:46:19,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 04:46:19,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 04:46:19,807 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 04:46:19,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 04:46:19" (1/3) ... [2018-04-12 04:46:19,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb26d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 04:46:19, skipping insertion in model container [2018-04-12 04:46:19,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:46:19" (2/3) ... [2018-04-12 04:46:19,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb26d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 04:46:19, skipping insertion in model container [2018-04-12 04:46:19,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 04:46:19" (3/3) ... [2018-04-12 04:46:19,810 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 04:46:19,817 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 04:46:19,822 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-12 04:46:19,847 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 04:46:19,847 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 04:46:19,847 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 04:46:19,848 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 04:46:19,848 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 04:46:19,848 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 04:46:19,848 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 04:46:19,848 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 04:46:19,848 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 04:46:19,849 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 04:46:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-04-12 04:46:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 04:46:19,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:19,865 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:19,866 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-04-12 04:46:19,901 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:19,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:19,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:19,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 04:46:19,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:19,949 INFO L182 omatonBuilderFactory]: Interpolants [71#true, 72#false] [2018-04-12 04:46:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:19,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-12 04:46:19,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-12 04:46:19,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-12 04:46:19,964 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-04-12 04:46:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:19,977 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-12 04:46:19,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-12 04:46:19,977 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-12 04:46:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:19,986 INFO L225 Difference]: With dead ends: 68 [2018-04-12 04:46:19,986 INFO L226 Difference]: Without dead ends: 65 [2018-04-12 04:46:19,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-12 04:46:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-12 04:46:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-12 04:46:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-12 04:46:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-12 04:46:20,011 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-04-12 04:46:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,011 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-12 04:46:20,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-12 04:46:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-12 04:46:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 04:46:20,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,012 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:20,012 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-04-12 04:46:20,013 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 04:46:20,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,051 INFO L182 omatonBuilderFactory]: Interpolants [208#(= main_~i~2 0), 206#true, 207#false] [2018-04-12 04:46:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 04:46:20,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 04:46:20,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 04:46:20,053 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-04-12 04:46:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:20,115 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-12 04:46:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 04:46:20,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-12 04:46:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:20,117 INFO L225 Difference]: With dead ends: 71 [2018-04-12 04:46:20,117 INFO L226 Difference]: Without dead ends: 71 [2018-04-12 04:46:20,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 04:46:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-12 04:46:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-04-12 04:46:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-12 04:46:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-12 04:46:20,123 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-04-12 04:46:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,123 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-12 04:46:20,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 04:46:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-12 04:46:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 04:46:20,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,124 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:20,124 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-04-12 04:46:20,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 04:46:20,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,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-12 04:46:20,187 INFO L182 omatonBuilderFactory]: Interpolants [344#true, 345#false, 346#(= 0 main_~i~2), 347#(= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|), 348#(= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 0), 349#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 0))] [2018-04-12 04:46:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 04:46:20,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 04:46:20,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 04:46:20,188 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-04-12 04:46:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:20,253 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-12 04:46:20,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 04:46:20,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-12 04:46:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:20,254 INFO L225 Difference]: With dead ends: 85 [2018-04-12 04:46:20,255 INFO L226 Difference]: Without dead ends: 85 [2018-04-12 04:46:20,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-12 04:46:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-12 04:46:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-04-12 04:46:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-12 04:46:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-12 04:46:20,262 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-04-12 04:46:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,262 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-12 04:46:20,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 04:46:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-12 04:46:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 04:46:20,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,263 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:20,263 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-04-12 04:46:20,264 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 04:46:20,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,312 INFO L182 omatonBuilderFactory]: Interpolants [518#true, 519#false, 520#(= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)), 521#(= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~b.base|)), 522#(= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.base))] [2018-04-12 04:46:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 04:46:20,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 04:46:20,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 04:46:20,313 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-04-12 04:46:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:20,371 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-04-12 04:46:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 04:46:20,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-12 04:46:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:20,373 INFO L225 Difference]: With dead ends: 77 [2018-04-12 04:46:20,373 INFO L226 Difference]: Without dead ends: 77 [2018-04-12 04:46:20,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 04:46:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-12 04:46:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-12 04:46:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-12 04:46:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-12 04:46:20,377 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-04-12 04:46:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,377 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-12 04:46:20,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 04:46:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-12 04:46:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 04:46:20,377 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,378 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:20,378 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-04-12 04:46:20,378 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 04:46:20,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,442 INFO L182 omatonBuilderFactory]: Interpolants [679#true, 680#false, 681#(= 0 main_~i~2), 682#(= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|), 683#(= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 684#(= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size|), 685#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size 0))] [2018-04-12 04:46:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 04:46:20,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 04:46:20,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 04:46:20,443 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-04-12 04:46:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:20,528 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-12 04:46:20,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 04:46:20,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-12 04:46:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:20,529 INFO L225 Difference]: With dead ends: 89 [2018-04-12 04:46:20,529 INFO L226 Difference]: Without dead ends: 89 [2018-04-12 04:46:20,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-12 04:46:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-12 04:46:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-04-12 04:46:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-12 04:46:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-12 04:46:20,535 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-12 04:46:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,535 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-12 04:46:20,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 04:46:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-12 04:46:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 04:46:20,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,536 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-04-12 04:46:20,536 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-04-12 04:46:20,537 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 04:46:20,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,573 INFO L182 omatonBuilderFactory]: Interpolants [864#(= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~res~0), 865#(= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#res|), 866#(= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~ret4| 0), 862#true, 863#false] [2018-04-12 04:46:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 04:46:20,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 04:46:20,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 04:46:20,573 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-04-12 04:46:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:20,587 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-12 04:46:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 04:46:20,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-12 04:46:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:20,588 INFO L225 Difference]: With dead ends: 91 [2018-04-12 04:46:20,588 INFO L226 Difference]: Without dead ends: 91 [2018-04-12 04:46:20,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 04:46:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-12 04:46:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-04-12 04:46:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-12 04:46:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-12 04:46:20,591 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-04-12 04:46:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,591 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-12 04:46:20,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 04:46:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-12 04:46:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 04:46:20,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,592 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-04-12 04:46:20,592 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-04-12 04:46:20,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 04:46:20,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,662 INFO L182 omatonBuilderFactory]: Interpolants [1048#true, 1049#false, 1050#(= 1 (select |#valid| |main_~#b~0.base|)), 1051#(= |#valid| |old(#valid)|), 1052#(and (= (store |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) |#valid|) (= (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0))] [2018-04-12 04:46:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 04:46:20,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 04:46:20,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 04:46:20,663 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-04-12 04:46:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:20,745 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-04-12 04:46:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 04:46:20,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-12 04:46:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:20,750 INFO L225 Difference]: With dead ends: 86 [2018-04-12 04:46:20,750 INFO L226 Difference]: Without dead ends: 86 [2018-04-12 04:46:20,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12 04:46:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-12 04:46:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-12 04:46:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-12 04:46:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-12 04:46:20,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-04-12 04:46:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:20,755 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-12 04:46:20,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 04:46:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-12 04:46:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 04:46:20,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:20,756 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-04-12 04:46:20,756 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-04-12 04:46:20,757 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:20,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:20,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 04:46:20,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,891 INFO L182 omatonBuilderFactory]: Interpolants [1232#(and (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |#length| (store |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)))), 1233#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 1234#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= main_~i~2 0)), 1227#true, 1228#false, 1229#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= (select |#valid| |main_~#b~0.base|) 1)), 1230#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= (select |#valid| |main_~#b~0.base|) 1) (= main_~i~2 0)), 1231#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-04-12 04:46:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:20,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 04:46:20,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 04:46:20,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 04:46:20,892 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-04-12 04:46:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:21,089 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-04-12 04:46:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 04:46:21,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-12 04:46:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:21,090 INFO L225 Difference]: With dead ends: 101 [2018-04-12 04:46:21,090 INFO L226 Difference]: Without dead ends: 101 [2018-04-12 04:46:21,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 04:46:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-12 04:46:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-04-12 04:46:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-12 04:46:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-04-12 04:46:21,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-04-12 04:46:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:21,095 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-04-12 04:46:21,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 04:46:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-04-12 04:46:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 04:46:21,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:21,096 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:21,096 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:21,096 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-04-12 04:46:21,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:21,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:21,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 04:46:21,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,147 INFO L182 omatonBuilderFactory]: Interpolants [1440#(= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)), 1441#(= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)), 1437#true, 1438#false, 1439#(= (select |#valid| |main_~#b~0.base|) 1)] [2018-04-12 04:46:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 04:46:21,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 04:46:21,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 04:46:21,148 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-04-12 04:46:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:21,178 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-04-12 04:46:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 04:46:21,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-12 04:46:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:21,180 INFO L225 Difference]: With dead ends: 96 [2018-04-12 04:46:21,180 INFO L226 Difference]: Without dead ends: 96 [2018-04-12 04:46:21,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 04:46:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-12 04:46:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-12 04:46:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-12 04:46:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-04-12 04:46:21,185 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-04-12 04:46:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:21,186 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-04-12 04:46:21,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 04:46:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-04-12 04:46:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 04:46:21,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:21,187 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:21,187 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-04-12 04:46:21,188 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:21,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:21,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 04:46:21,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,367 INFO L182 omatonBuilderFactory]: Interpolants [1637#true, 1638#false, 1639#(= 0 |main_~#b~0.offset|), 1640#(and (= 0 |main_~#b~0.offset|) (= main_~i~2 0)), 1641#(and (<= 4 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|) (= main_~i~2 0)), 1642#(and (<= 4 (select |#length| |main_~#b~0.base|)) (<= main_~i~2 1) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 1643#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 1) (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) (<= 4 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (= (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) 1)), 1644#(and (<= 4 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) 1) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 1645#(and (<= 4 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 1646#(and (or (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)) (or (< 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) (and (<= 4 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0))) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 1647#(and (<= 4 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0))] [2018-04-12 04:46:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 04:46:21,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 04:46:21,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-12 04:46:21,368 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 11 states. [2018-04-12 04:46:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:21,564 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2018-04-12 04:46:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 04:46:21,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-12 04:46:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:21,565 INFO L225 Difference]: With dead ends: 129 [2018-04-12 04:46:21,565 INFO L226 Difference]: Without dead ends: 129 [2018-04-12 04:46:21,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-12 04:46:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-12 04:46:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2018-04-12 04:46:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-12 04:46:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-04-12 04:46:21,569 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 42 [2018-04-12 04:46:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:21,569 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-04-12 04:46:21,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 04:46:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-04-12 04:46:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 04:46:21,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:21,570 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:21,570 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-04-12 04:46:21,571 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:21,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 04:46:21,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:21,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 04:46:21,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,650 INFO L182 omatonBuilderFactory]: Interpolants [1906#true, 1907#false, 1908#(= 0 |main_~#b~0.offset|), 1909#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|) (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|)), 1910#(and (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 1911#(and (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0) (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 1912#(and (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (<= (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) 4) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))), 1913#(and (<= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| 0) (<= (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) 4) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)))] [2018-04-12 04:46:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 04:46:21,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 04:46:21,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 04:46:21,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-12 04:46:21,651 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 8 states. [2018-04-12 04:46:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:21,772 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-04-12 04:46:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 04:46:21,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-04-12 04:46:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:21,773 INFO L225 Difference]: With dead ends: 114 [2018-04-12 04:46:21,773 INFO L226 Difference]: Without dead ends: 114 [2018-04-12 04:46:21,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-12 04:46:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-12 04:46:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-04-12 04:46:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-12 04:46:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-04-12 04:46:21,777 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 43 [2018-04-12 04:46:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:21,777 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-04-12 04:46:21,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 04:46:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-04-12 04:46:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 04:46:21,778 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:21,778 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:21,778 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-04-12 04:46:21,779 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:21,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:21,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-12 04:46:21,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,826 INFO L182 omatonBuilderFactory]: Interpolants [2152#true, 2153#false, 2154#(= main_~i~2 0), 2155#(<= 1 main_~i~2), 2156#(<= 1 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|), 2157#(<= 1 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 2158#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0) (<= 1 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size))] [2018-04-12 04:46:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 04:46:21,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 04:46:21,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 04:46:21,827 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-04-12 04:46:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:21,897 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-04-12 04:46:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 04:46:21,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-12 04:46:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:21,898 INFO L225 Difference]: With dead ends: 127 [2018-04-12 04:46:21,898 INFO L226 Difference]: Without dead ends: 127 [2018-04-12 04:46:21,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-12 04:46:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-12 04:46:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-04-12 04:46:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 04:46:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-12 04:46:21,902 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 46 [2018-04-12 04:46:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:21,903 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-12 04:46:21,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 04:46:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-12 04:46:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 04:46:21,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:21,904 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:21,904 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-04-12 04:46:21,905 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:21,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-12 04:46:21,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 04:46:21,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 04:46:21,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:21,976 INFO L182 omatonBuilderFactory]: Interpolants [2410#true, 2411#false, 2412#(= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|), 2413#(and (<= 4 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|)), 2414#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~b.offset|) (<= 4 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~b.base|))), 2415#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 0) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= 4 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.base)))] [2018-04-12 04:46:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-12 04:46:21,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 04:46:21,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 04:46:21,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 04:46:21,976 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 6 states. [2018-04-12 04:46:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:22,026 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-04-12 04:46:22,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 04:46:22,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-12 04:46:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:22,028 INFO L225 Difference]: With dead ends: 126 [2018-04-12 04:46:22,028 INFO L226 Difference]: Without dead ends: 126 [2018-04-12 04:46:22,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-12 04:46:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-12 04:46:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-04-12 04:46:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-12 04:46:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-04-12 04:46:22,032 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 52 [2018-04-12 04:46:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:22,033 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-04-12 04:46:22,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 04:46:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-04-12 04:46:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 04:46:22,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:22,034 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:22,034 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-04-12 04:46:22,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:22,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 04:46:22,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:22,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-12 04:46:22,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:22,145 INFO L182 omatonBuilderFactory]: Interpolants [2672#(and (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size 1) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0)), 2673#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0) (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0) 4))), 2674#(and (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0)), 2664#true, 2665#false, 2666#(= main_~i~2 0), 2667#(<= main_~i~2 1), 2668#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 1), 2669#(<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1), 2670#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 2671#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~b.offset|) (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 1))] [2018-04-12 04:46:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 04:46:22,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 04:46:22,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 04:46:22,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 04:46:22,146 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 11 states. [2018-04-12 04:46:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:22,289 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-04-12 04:46:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 04:46:22,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-04-12 04:46:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:22,290 INFO L225 Difference]: With dead ends: 138 [2018-04-12 04:46:22,291 INFO L226 Difference]: Without dead ends: 138 [2018-04-12 04:46:22,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-12 04:46:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-12 04:46:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-04-12 04:46:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 04:46:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-12 04:46:22,295 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-04-12 04:46:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:22,295 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-12 04:46:22,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 04:46:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-12 04:46:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 04:46:22,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:22,296 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-04-12 04:46:22,296 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-04-12 04:46:22,297 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:22,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-12 04:46:22,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:22,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 04:46:22,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:22,403 INFO L182 omatonBuilderFactory]: Interpolants [2960#(= 0 |main_~#b~0.offset|), 2961#(or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)), 2962#(and (or (not (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 1) __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)) (or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset))), 2963#(or (not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)) (<= 1 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)), 2964#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 0)), 2965#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 0), 2966#(not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)), 2958#true, 2959#false] [2018-04-12 04:46:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-12 04:46:22,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 04:46:22,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 04:46:22,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 04:46:22,404 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 9 states. [2018-04-12 04:46:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:22,506 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-04-12 04:46:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 04:46:22,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-04-12 04:46:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:22,507 INFO L225 Difference]: With dead ends: 146 [2018-04-12 04:46:22,507 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 04:46:22,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-12 04:46:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 04:46:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-04-12 04:46:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 04:46:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-04-12 04:46:22,509 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-04-12 04:46:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:22,509 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-04-12 04:46:22,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 04:46:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-04-12 04:46:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 04:46:22,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:22,510 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:22,510 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-04-12 04:46:22,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:22,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-12 04:46:22,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:22,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 04:46:22,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:22,716 INFO L182 omatonBuilderFactory]: Interpolants [3245#true, 3246#false, 3247#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 3248#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= main_~i~2 0)), 3249#(= |old(#length)| |#length|), 3250#(= |#length| (store |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))), 3251#(and (or (= 0 (select |#valid| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 3252#(and (or (= 400 (select |#length| |main_~#b~0.base|)) (= 0 (select |#valid| |main_~#b~0.base|))) (= |main_~#b~0.offset| 0) (= main_~i~2 0)), 3253#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= (select |#valid| |main_~#b~0.base|) 1) (= main_~i~2 0)), 3254#(and (= 400 (select |#length| |main_~#b~0.base|)) (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (<= main_~i~2 1) (= (select |#valid| |main_~#b~0.base|) 1)), 3255#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3256#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (= (select |old(#length)| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= |#valid| |old(#valid)|)), 3257#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (or (= (select |old(#length)| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base))), 3258#(and (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (or (= (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (select |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|))), 3259#(or (= (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (select |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|))), 3260#(and (= 400 (select |#length| |main_~#b~0.base|)) (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (<= main_~i~2 1))] [2018-04-12 04:46:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-12 04:46:22,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 04:46:22,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 04:46:22,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-04-12 04:46:22,717 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 16 states. [2018-04-12 04:46:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:23,051 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-04-12 04:46:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 04:46:23,052 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-12 04:46:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:23,052 INFO L225 Difference]: With dead ends: 141 [2018-04-12 04:46:23,052 INFO L226 Difference]: Without dead ends: 141 [2018-04-12 04:46:23,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-04-12 04:46:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-12 04:46:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-04-12 04:46:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 04:46:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-04-12 04:46:23,055 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 67 [2018-04-12 04:46:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:23,055 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-04-12 04:46:23,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 04:46:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-04-12 04:46:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 04:46:23,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:23,056 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-04-12 04:46:23,056 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1765271438, now seen corresponding path program 1 times [2018-04-12 04:46:23,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:23,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-12 04:46:23,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:23,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 04:46:23,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:23,160 INFO L182 omatonBuilderFactory]: Interpolants [3552#(and (= (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) 1) (<= 8 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 3553#(and (<= 8 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 3554#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0) (<= 8 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 3544#true, 3545#false, 3546#(= 0 |main_~#b~0.offset|), 3547#(and (<= 0 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= 0 |main_~#b~0.offset|)), 3548#(and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= 0 |main_~#b~0.offset|)), 3549#(= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|), 3550#(and (<= 8 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 3551#(and (<= 8 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) (= (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) 1))] [2018-04-12 04:46:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-12 04:46:23,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 04:46:23,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 04:46:23,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 04:46:23,161 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 11 states. [2018-04-12 04:46:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:23,396 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-12 04:46:23,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 04:46:23,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-04-12 04:46:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:23,397 INFO L225 Difference]: With dead ends: 134 [2018-04-12 04:46:23,397 INFO L226 Difference]: Without dead ends: 134 [2018-04-12 04:46:23,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-04-12 04:46:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-12 04:46:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-04-12 04:46:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-12 04:46:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-12 04:46:23,399 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 78 [2018-04-12 04:46:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:23,400 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-12 04:46:23,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 04:46:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-12 04:46:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-12 04:46:23,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:23,400 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:23,400 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-04-12 04:46:23,401 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:23,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-12 04:46:23,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:23,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-12 04:46:23,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:23,427 INFO L182 omatonBuilderFactory]: Interpolants [3834#true, 3835#false, 3836#(= main_~i~2 0), 3837#(<= main_~i~2 1), 3838#(<= main_~i~2 2)] [2018-04-12 04:46:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-12 04:46:23,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 04:46:23,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 04:46:23,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 04:46:23,428 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 5 states. [2018-04-12 04:46:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:23,450 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-04-12 04:46:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 04:46:23,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-04-12 04:46:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:23,451 INFO L225 Difference]: With dead ends: 136 [2018-04-12 04:46:23,451 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 04:46:23,451 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-12 04:46:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 04:46:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-04-12 04:46:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 04:46:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-12 04:46:23,454 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 80 [2018-04-12 04:46:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:23,454 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-12 04:46:23,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 04:46:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-12 04:46:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-12 04:46:23,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:23,454 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-04-12 04:46:23,455 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:23,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 2 times [2018-04-12 04:46:23,455 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:23,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-12 04:46:23,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:23,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 04:46:23,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:23,613 INFO L182 omatonBuilderFactory]: Interpolants [4105#true, 4106#false, 4107#(= 0 |main_~#b~0.offset|), 4108#(and (= 0 |main_~#b~0.offset|) (= main_~i~2 0)), 4109#(= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|), 4110#(and (<= (+ (* 4 main_~i~2) 4) (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 4111#(and (<= (* 4 main_~i~2) (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|)), 4112#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|) (= (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) 1) (<= (* 4 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|))), 4113#(and (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) 1) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 4114#(and (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 4115#(and (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (<= 0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 4116#(and (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (<= 4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)), 4117#(and (<= 4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))) (<= (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) 4) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0))] [2018-04-12 04:46:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-12 04:46:23,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 04:46:23,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 04:46:23,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-12 04:46:23,614 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 13 states. [2018-04-12 04:46:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:23,819 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-04-12 04:46:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 04:46:23,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-04-12 04:46:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:23,820 INFO L225 Difference]: With dead ends: 136 [2018-04-12 04:46:23,820 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 04:46:23,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-04-12 04:46:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 04:46:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-04-12 04:46:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 04:46:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-04-12 04:46:23,824 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 84 [2018-04-12 04:46:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:23,824 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-04-12 04:46:23,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 04:46:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-04-12 04:46:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-12 04:46:23,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:23,825 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-04-12 04:46:23,826 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1044060343, now seen corresponding path program 1 times [2018-04-12 04:46:23,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:23,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-04-12 04:46:23,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:23,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 04:46:23,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:23,975 INFO L182 omatonBuilderFactory]: Interpolants [4400#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))), 4401#(and (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~b.offset|) (<= (* 4 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size|) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~b.base|))), 4402#(and (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0)), 4403#(and (<= 0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0)), 4404#(and (<= 4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (<= (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0)), 4405#(and (<= 4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0))) (<= (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0) 4) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.base)) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~b.offset 0)), 4396#true, 4397#false, 4398#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~n|), 4399#(<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)] [2018-04-12 04:46:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-04-12 04:46:23,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 04:46:23,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 04:46:23,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 04:46:23,976 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 10 states. [2018-04-12 04:46:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:24,097 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-04-12 04:46:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 04:46:24,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-04-12 04:46:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:24,098 INFO L225 Difference]: With dead ends: 129 [2018-04-12 04:46:24,098 INFO L226 Difference]: Without dead ends: 129 [2018-04-12 04:46:24,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-04-12 04:46:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-12 04:46:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-04-12 04:46:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-12 04:46:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-04-12 04:46:24,101 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 93 [2018-04-12 04:46:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:24,102 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-04-12 04:46:24,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 04:46:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-04-12 04:46:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-12 04:46:24,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:24,103 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:24,103 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1115175640, now seen corresponding path program 2 times [2018-04-12 04:46:24,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:24,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-04-12 04:46:24,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:24,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 04:46:24,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:24,260 INFO L182 omatonBuilderFactory]: Interpolants [4672#false, 4673#(= 0 |main_~#b~0.offset|), 4674#(and (or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)) (or (not (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|))), 4675#(and (or (not (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (<= (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|)) (or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset))), 4676#(or (<= 1 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0))), 4677#(<= 1 main_~i~2), 4678#(<= 2 main_~i~2), 4679#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 4680#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 0) (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)), 4681#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 1)), 4682#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 1), 4671#true] [2018-04-12 04:46:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-04-12 04:46:24,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 04:46:24,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 04:46:24,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-12 04:46:24,261 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 12 states. [2018-04-12 04:46:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:24,559 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-12 04:46:24,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 04:46:24,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-04-12 04:46:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:24,561 INFO L225 Difference]: With dead ends: 164 [2018-04-12 04:46:24,561 INFO L226 Difference]: Without dead ends: 155 [2018-04-12 04:46:24,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2018-04-12 04:46:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-12 04:46:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2018-04-12 04:46:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-12 04:46:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-12 04:46:24,564 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 103 [2018-04-12 04:46:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:24,564 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-12 04:46:24,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 04:46:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-12 04:46:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-12 04:46:24,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:24,565 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-04-12 04:46:24,565 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:24,565 INFO L82 PathProgramCache]: Analyzing trace with hash -260385982, now seen corresponding path program 3 times [2018-04-12 04:46:24,565 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:24,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-04-12 04:46:24,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:24,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 04:46:24,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:24,682 INFO L182 omatonBuilderFactory]: Interpolants [5008#(= 0 |main_~#b~0.offset|), 5009#(or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)), 5010#(and (or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)) (or (not (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (<= 0 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))))), 5011#(and (or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)) (or (not (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (<= 4 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))))), 5012#(and (or (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset)) (or (not (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (<= 8 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size))))), 5013#(or (not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)) (<= 2 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)), 5014#(and (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size) (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0 0)), 5015#(<= (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~i~0) (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_~size 1)), 5016#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 1), 5017#(not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)), 5006#true, 5007#false] [2018-04-12 04:46:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-04-12 04:46:24,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 04:46:24,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 04:46:24,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-12 04:46:24,682 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 12 states. [2018-04-12 04:46:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:24,804 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-04-12 04:46:24,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 04:46:24,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-04-12 04:46:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:24,807 INFO L225 Difference]: With dead ends: 166 [2018-04-12 04:46:24,807 INFO L226 Difference]: Without dead ends: 140 [2018-04-12 04:46:24,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-12 04:46:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-12 04:46:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-04-12 04:46:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-12 04:46:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-04-12 04:46:24,810 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 109 [2018-04-12 04:46:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:24,815 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-04-12 04:46:24,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 04:46:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-04-12 04:46:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-12 04:46:24,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:24,815 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:24,815 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:24,816 INFO L82 PathProgramCache]: Analyzing trace with hash -562399357, now seen corresponding path program 4 times [2018-04-12 04:46:24,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:24,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 66 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-12 04:46:25,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:25,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 04:46:25,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:25,162 INFO L182 omatonBuilderFactory]: Interpolants [5344#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5345#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (= (select |old(#length)| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= |#valid| |old(#valid)|)), 5346#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (or (= (select |old(#length)| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base))), 5347#(and (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (or (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (<= (select |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)))), 5348#(or (<= (select |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (= 0 (select |old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|))), 5349#(and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (<= (+ (* 4 main_~i~2) 4) (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 5329#true, 5330#false, 5331#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 5332#(= |old(#length)| |#length|), 5333#(= |#length| (store |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|))), 5334#(and (or (= 0 (select |#valid| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 5335#(or (= 0 (select |#valid| |main_~#b~0.base|)) (and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0))), 5336#(or (and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)) (< 98 main_~i~2)), 5337#(and (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) (= |old(#length)| |#length|)), 5338#(and (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base) (= |#length| (store |old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)))), 5339#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base| (@diff |old(#length)| |#length|))) (= 0 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (= |old(#length)| |#length|))), 5340#(or (= 0 (select |#valid| |main_~#b~0.base|)) (and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)) (< 98 main_~i~2)), 5341#(and (= (select |#valid| |main_~#b~0.base|) 1) (or (and (<= 0 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)) (< 98 main_~i~2))), 5342#(and (or (and (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400)) (<= 100 main_~i~2)) (= (select |#valid| |main_~#b~0.base|) 1)), 5343#(and (<= (* 4 main_~i~2) 396) (<= 4 (+ (* 4 main_~i~2) |main_~#b~0.offset|)) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (= (select |#valid| |main_~#b~0.base|) 1))] [2018-04-12 04:46:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 66 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-12 04:46:25,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 04:46:25,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 04:46:25,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-04-12 04:46:25,163 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 21 states. [2018-04-12 04:46:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:25,464 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-04-12 04:46:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 04:46:25,498 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-12 04:46:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:25,499 INFO L225 Difference]: With dead ends: 136 [2018-04-12 04:46:25,499 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 04:46:25,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2018-04-12 04:46:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 04:46:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-04-12 04:46:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-12 04:46:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-04-12 04:46:25,501 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 114 [2018-04-12 04:46:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:25,501 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-04-12 04:46:25,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 04:46:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-04-12 04:46:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-12 04:46:25,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:25,502 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:25,502 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash -277595443, now seen corresponding path program 1 times [2018-04-12 04:46:25,503 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:25,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-12 04:46:25,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:25,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 04:46:25,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 04:46:25,550 INFO L182 omatonBuilderFactory]: Interpolants [5638#true, 5639#false, 5640#(= main_~i~2 0), 5641#(<= main_~i~2 1), 5642#(<= main_~i~2 2), 5643#(<= main_~i~2 3)] [2018-04-12 04:46:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-12 04:46:25,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 04:46:25,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 04:46:25,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-12 04:46:25,551 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 6 states. [2018-04-12 04:46:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:25,584 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-04-12 04:46:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 04:46:25,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-04-12 04:46:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:25,585 INFO L225 Difference]: With dead ends: 148 [2018-04-12 04:46:25,585 INFO L226 Difference]: Without dead ends: 148 [2018-04-12 04:46:25,585 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-12 04:46:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-12 04:46:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-04-12 04:46:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-12 04:46:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-04-12 04:46:25,589 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 122 [2018-04-12 04:46:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:25,589 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-04-12 04:46:25,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 04:46:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-04-12 04:46:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-12 04:46:25,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:25,591 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:25,591 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 313375475, now seen corresponding path program 2 times [2018-04-12 04:46:25,592 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:25,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-04-12 04:46:25,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:25,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-12 04:46:25,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-04-12 04:46:25,690 INFO L182 omatonBuilderFactory]: Interpolants [5936#false, 5937#(= main_~i~2 0), 5938#(<= main_~i~2 1), 5939#(<= main_~i~2 2), 5940#(<= main_~i~2 3), 5941#(<= main_~i~2 4), 5935#true] [2018-04-12 04:46:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-04-12 04:46:25,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 04:46:25,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 04:46:25,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-12 04:46:25,691 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 7 states. [2018-04-12 04:46:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:25,727 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-04-12 04:46:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 04:46:25,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-04-12 04:46:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:25,728 INFO L225 Difference]: With dead ends: 155 [2018-04-12 04:46:25,728 INFO L226 Difference]: Without dead ends: 155 [2018-04-12 04:46:25,729 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-12 04:46:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-12 04:46:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-04-12 04:46:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 04:46:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-04-12 04:46:25,732 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 169 [2018-04-12 04:46:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:25,733 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-04-12 04:46:25,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 04:46:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-04-12 04:46:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-04-12 04:46:25,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:25,734 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:25,734 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2136490509, now seen corresponding path program 3 times [2018-04-12 04:46:25,735 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:25,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-04-12 04:46:25,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:25,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 04:46:25,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-04-12 04:46:25,879 INFO L182 omatonBuilderFactory]: Interpolants [6247#true, 6248#false, 6249#(= main_~i~2 0), 6250#(<= main_~i~2 1), 6251#(<= main_~i~2 2), 6252#(<= main_~i~2 3), 6253#(<= main_~i~2 4), 6254#(<= main_~i~2 5)] [2018-04-12 04:46:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-04-12 04:46:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 04:46:25,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 04:46:25,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-12 04:46:25,880 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 8 states. [2018-04-12 04:46:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:25,915 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-04-12 04:46:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 04:46:25,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-04-12 04:46:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:25,916 INFO L225 Difference]: With dead ends: 162 [2018-04-12 04:46:25,916 INFO L226 Difference]: Without dead ends: 162 [2018-04-12 04:46:25,917 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-12 04:46:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-12 04:46:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2018-04-12 04:46:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-12 04:46:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-04-12 04:46:25,921 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 216 [2018-04-12 04:46:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:25,921 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-04-12 04:46:25,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 04:46:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-04-12 04:46:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-04-12 04:46:25,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:25,923 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:25,923 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash -882947149, now seen corresponding path program 4 times [2018-04-12 04:46:25,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:25,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-04-12 04:46:26,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:26,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 04:46:26,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-04-12 04:46:26,102 INFO L182 omatonBuilderFactory]: Interpolants [6576#(= main_~i~2 0), 6577#(<= main_~i~2 1), 6578#(<= main_~i~2 2), 6579#(<= main_~i~2 3), 6580#(<= main_~i~2 4), 6581#(<= main_~i~2 5), 6582#(<= main_~i~2 6), 6574#true, 6575#false] [2018-04-12 04:46:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-04-12 04:46:26,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 04:46:26,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 04:46:26,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-12 04:46:26,104 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 9 states. [2018-04-12 04:46:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:26,157 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-04-12 04:46:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 04:46:26,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2018-04-12 04:46:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:26,159 INFO L225 Difference]: With dead ends: 169 [2018-04-12 04:46:26,159 INFO L226 Difference]: Without dead ends: 169 [2018-04-12 04:46:26,159 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-12 04:46:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-12 04:46:26,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-04-12 04:46:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-12 04:46:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-12 04:46:26,164 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 263 [2018-04-12 04:46:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:26,164 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-12 04:46:26,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 04:46:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-12 04:46:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-12 04:46:26,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:26,166 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:26,166 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 93198669, now seen corresponding path program 5 times [2018-04-12 04:46:26,167 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:26,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1279 trivial. 0 not checked. [2018-04-12 04:46:26,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:26,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 04:46:26,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-04-12 04:46:26,396 INFO L182 omatonBuilderFactory]: Interpolants [6916#true, 6917#false, 6918#(= main_~i~2 0), 6919#(<= main_~i~2 1), 6920#(<= main_~i~2 2), 6921#(<= main_~i~2 3), 6922#(<= main_~i~2 4), 6923#(<= main_~i~2 5), 6924#(<= main_~i~2 6), 6925#(<= main_~i~2 7)] [2018-04-12 04:46:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1279 trivial. 0 not checked. [2018-04-12 04:46:26,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 04:46:26,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 04:46:26,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-12 04:46:26,397 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-04-12 04:46:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:26,457 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-04-12 04:46:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 04:46:26,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 310 [2018-04-12 04:46:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:26,458 INFO L225 Difference]: With dead ends: 176 [2018-04-12 04:46:26,459 INFO L226 Difference]: Without dead ends: 176 [2018-04-12 04:46:26,459 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-12 04:46:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-12 04:46:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-04-12 04:46:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-12 04:46:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-04-12 04:46:26,463 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 310 [2018-04-12 04:46:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:26,464 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-04-12 04:46:26,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 04:46:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-04-12 04:46:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-12 04:46:26,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:26,466 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:26,466 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1457189773, now seen corresponding path program 6 times [2018-04-12 04:46:26,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:26,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-04-12 04:46:26,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:26,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-12 04:46:26,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-04-12 04:46:26,754 INFO L182 omatonBuilderFactory]: Interpolants [7280#(<= main_~i~2 5), 7281#(<= main_~i~2 6), 7282#(<= main_~i~2 7), 7283#(<= main_~i~2 8), 7273#true, 7274#false, 7275#(= main_~i~2 0), 7276#(<= main_~i~2 1), 7277#(<= main_~i~2 2), 7278#(<= main_~i~2 3), 7279#(<= main_~i~2 4)] [2018-04-12 04:46:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-04-12 04:46:26,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 04:46:26,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 04:46:26,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-12 04:46:26,755 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 11 states. [2018-04-12 04:46:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:26,815 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-04-12 04:46:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 04:46:26,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2018-04-12 04:46:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:26,817 INFO L225 Difference]: With dead ends: 183 [2018-04-12 04:46:26,817 INFO L226 Difference]: Without dead ends: 183 [2018-04-12 04:46:26,817 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-12 04:46:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-12 04:46:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-04-12 04:46:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-12 04:46:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2018-04-12 04:46:26,821 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 357 [2018-04-12 04:46:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:26,822 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2018-04-12 04:46:26,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 04:46:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2018-04-12 04:46:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-12 04:46:26,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:26,824 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:26,824 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1787412621, now seen corresponding path program 7 times [2018-04-12 04:46:26,825 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:26,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2018-04-12 04:46:27,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:27,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 04:46:27,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-04-12 04:46:27,171 INFO L182 omatonBuilderFactory]: Interpolants [7648#(<= main_~i~2 1), 7649#(<= main_~i~2 2), 7650#(<= main_~i~2 3), 7651#(<= main_~i~2 4), 7652#(<= main_~i~2 5), 7653#(<= main_~i~2 6), 7654#(<= main_~i~2 7), 7655#(<= main_~i~2 8), 7656#(<= main_~i~2 9), 7645#true, 7646#false, 7647#(= main_~i~2 0)] [2018-04-12 04:46:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2597 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2018-04-12 04:46:27,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 04:46:27,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 04:46:27,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-12 04:46:27,172 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand 12 states. [2018-04-12 04:46:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:27,255 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-04-12 04:46:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 04:46:27,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 404 [2018-04-12 04:46:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:27,257 INFO L225 Difference]: With dead ends: 190 [2018-04-12 04:46:27,257 INFO L226 Difference]: Without dead ends: 190 [2018-04-12 04:46:27,257 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-12 04:46:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-12 04:46:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2018-04-12 04:46:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-12 04:46:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-04-12 04:46:27,264 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 404 [2018-04-12 04:46:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:27,264 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-04-12 04:46:27,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 04:46:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-04-12 04:46:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-04-12 04:46:27,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:27,267 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:27,267 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 487259443, now seen corresponding path program 8 times [2018-04-12 04:46:27,268 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:27,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3303 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2018-04-12 04:46:27,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:27,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 04:46:27,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2018-04-12 04:46:27,622 INFO L182 omatonBuilderFactory]: Interpolants [8032#true, 8033#false, 8034#(= main_~i~2 0), 8035#(<= main_~i~2 1), 8036#(<= main_~i~2 2), 8037#(<= main_~i~2 3), 8038#(<= main_~i~2 4), 8039#(<= main_~i~2 5), 8040#(<= main_~i~2 6), 8041#(<= main_~i~2 7), 8042#(<= main_~i~2 8), 8043#(<= main_~i~2 9), 8044#(<= main_~i~2 10)] [2018-04-12 04:46:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3303 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2018-04-12 04:46:27,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 04:46:27,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 04:46:27,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-12 04:46:27,623 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 13 states. [2018-04-12 04:46:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:27,710 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-04-12 04:46:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 04:46:27,710 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 451 [2018-04-12 04:46:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:27,711 INFO L225 Difference]: With dead ends: 197 [2018-04-12 04:46:27,712 INFO L226 Difference]: Without dead ends: 197 [2018-04-12 04:46:27,712 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-12 04:46:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-12 04:46:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-04-12 04:46:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-12 04:46:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-04-12 04:46:27,717 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 451 [2018-04-12 04:46:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:27,717 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-04-12 04:46:27,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 04:46:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-04-12 04:46:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-04-12 04:46:27,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:27,720 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:27,721 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1279313971, now seen corresponding path program 9 times [2018-04-12 04:46:27,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:27,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4094 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-04-12 04:46:28,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:28,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 04:46:28,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2018-04-12 04:46:28,184 INFO L182 omatonBuilderFactory]: Interpolants [8434#true, 8435#false, 8436#(= main_~i~2 0), 8437#(<= main_~i~2 1), 8438#(<= main_~i~2 2), 8439#(<= main_~i~2 3), 8440#(<= main_~i~2 4), 8441#(<= main_~i~2 5), 8442#(<= main_~i~2 6), 8443#(<= main_~i~2 7), 8444#(<= main_~i~2 8), 8445#(<= main_~i~2 9), 8446#(<= main_~i~2 10), 8447#(<= main_~i~2 11)] [2018-04-12 04:46:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4094 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3687 trivial. 0 not checked. [2018-04-12 04:46:28,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 04:46:28,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 04:46:28,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-12 04:46:28,185 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 14 states. [2018-04-12 04:46:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:28,279 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-04-12 04:46:28,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 04:46:28,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 498 [2018-04-12 04:46:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:28,281 INFO L225 Difference]: With dead ends: 204 [2018-04-12 04:46:28,281 INFO L226 Difference]: Without dead ends: 204 [2018-04-12 04:46:28,281 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-12 04:46:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-12 04:46:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2018-04-12 04:46:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-12 04:46:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-04-12 04:46:28,286 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 498 [2018-04-12 04:46:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:28,287 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-04-12 04:46:28,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 04:46:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-04-12 04:46:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-04-12 04:46:28,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:28,290 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 21, 21, 21, 21, 21, 21, 21, 21, 21, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:28,290 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:28,291 INFO L82 PathProgramCache]: Analyzing trace with hash -618848781, now seen corresponding path program 10 times [2018-04-12 04:46:28,291 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:28,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 4484 trivial. 0 not checked. [2018-04-12 04:46:28,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:28,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 04:46:28,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-04-12 04:46:28,896 INFO L182 omatonBuilderFactory]: Interpolants [8864#(<= main_~i~2 11), 8865#(<= main_~i~2 12), 8851#true, 8852#false, 8853#(= main_~i~2 0), 8854#(<= main_~i~2 1), 8855#(<= main_~i~2 2), 8856#(<= main_~i~2 3), 8857#(<= main_~i~2 4), 8858#(<= main_~i~2 5), 8859#(<= main_~i~2 6), 8860#(<= main_~i~2 7), 8861#(<= main_~i~2 8), 8862#(<= main_~i~2 9), 8863#(<= main_~i~2 10)] [2018-04-12 04:46:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 4484 trivial. 0 not checked. [2018-04-12 04:46:28,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 04:46:28,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 04:46:28,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-12 04:46:28,898 INFO L87 Difference]: Start difference. First operand 199 states and 213 transitions. Second operand 15 states. [2018-04-12 04:46:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:28,985 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-04-12 04:46:28,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 04:46:28,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 545 [2018-04-12 04:46:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:28,987 INFO L225 Difference]: With dead ends: 211 [2018-04-12 04:46:28,987 INFO L226 Difference]: Without dead ends: 211 [2018-04-12 04:46:28,988 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-12 04:46:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-12 04:46:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-04-12 04:46:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-12 04:46:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2018-04-12 04:46:28,993 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 545 [2018-04-12 04:46:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:28,994 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2018-04-12 04:46:28,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 04:46:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2018-04-12 04:46:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-12 04:46:28,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:28,999 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 23, 23, 23, 23, 23, 23, 23, 23, 23, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:28,999 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1134722829, now seen corresponding path program 11 times [2018-04-12 04:46:29,000 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:29,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 5359 trivial. 0 not checked. [2018-04-12 04:46:29,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:29,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 04:46:29,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-04-12 04:46:29,583 INFO L182 omatonBuilderFactory]: Interpolants [9283#true, 9284#false, 9285#(= main_~i~2 0), 9286#(<= main_~i~2 1), 9287#(<= main_~i~2 2), 9288#(<= main_~i~2 3), 9289#(<= main_~i~2 4), 9290#(<= main_~i~2 5), 9291#(<= main_~i~2 6), 9292#(<= main_~i~2 7), 9293#(<= main_~i~2 8), 9294#(<= main_~i~2 9), 9295#(<= main_~i~2 10), 9296#(<= main_~i~2 11), 9297#(<= main_~i~2 12), 9298#(<= main_~i~2 13)] [2018-04-12 04:46:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 5359 trivial. 0 not checked. [2018-04-12 04:46:29,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 04:46:29,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 04:46:29,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-12 04:46:29,585 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand 16 states. [2018-04-12 04:46:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:29,694 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2018-04-12 04:46:29,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 04:46:29,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 592 [2018-04-12 04:46:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:29,696 INFO L225 Difference]: With dead ends: 218 [2018-04-12 04:46:29,696 INFO L226 Difference]: Without dead ends: 218 [2018-04-12 04:46:29,697 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-12 04:46:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-12 04:46:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-04-12 04:46:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 04:46:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 229 transitions. [2018-04-12 04:46:29,702 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 229 transitions. Word has length 592 [2018-04-12 04:46:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:29,707 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 229 transitions. [2018-04-12 04:46:29,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 04:46:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 229 transitions. [2018-04-12 04:46:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-04-12 04:46:29,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:29,712 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 25, 25, 25, 25, 25, 25, 25, 25, 25, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:29,713 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1704497485, now seen corresponding path program 12 times [2018-04-12 04:46:29,714 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:29,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6977 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 6312 trivial. 0 not checked. [2018-04-12 04:46:30,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:30,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 04:46:30,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-12 04:46:30,547 INFO L182 omatonBuilderFactory]: Interpolants [9730#true, 9731#false, 9732#(= main_~i~2 0), 9733#(<= main_~i~2 1), 9734#(<= main_~i~2 2), 9735#(<= main_~i~2 3), 9736#(<= main_~i~2 4), 9737#(<= main_~i~2 5), 9738#(<= main_~i~2 6), 9739#(<= main_~i~2 7), 9740#(<= main_~i~2 8), 9741#(<= main_~i~2 9), 9742#(<= main_~i~2 10), 9743#(<= main_~i~2 11), 9744#(<= main_~i~2 12), 9745#(<= main_~i~2 13), 9746#(<= main_~i~2 14)] [2018-04-12 04:46:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6977 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 6312 trivial. 0 not checked. [2018-04-12 04:46:30,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 04:46:30,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 04:46:30,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-12 04:46:30,548 INFO L87 Difference]: Start difference. First operand 213 states and 229 transitions. Second operand 17 states. [2018-04-12 04:46:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:30,634 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2018-04-12 04:46:30,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 04:46:30,634 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 639 [2018-04-12 04:46:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:30,635 INFO L225 Difference]: With dead ends: 225 [2018-04-12 04:46:30,635 INFO L226 Difference]: Without dead ends: 225 [2018-04-12 04:46:30,635 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-12 04:46:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-12 04:46:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-04-12 04:46:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-12 04:46:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 237 transitions. [2018-04-12 04:46:30,638 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 237 transitions. Word has length 639 [2018-04-12 04:46:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:30,639 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 237 transitions. [2018-04-12 04:46:30,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 04:46:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 237 transitions. [2018-04-12 04:46:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2018-04-12 04:46:30,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:30,642 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 27, 27, 27, 27, 27, 27, 27, 27, 27, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:30,642 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash 430413389, now seen corresponding path program 13 times [2018-04-12 04:46:30,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:30,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8108 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 7343 trivial. 0 not checked. [2018-04-12 04:46:31,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:31,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 04:46:31,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-04-12 04:46:31,360 INFO L182 omatonBuilderFactory]: Interpolants [10208#(<= main_~i~2 14), 10209#(<= main_~i~2 15), 10192#true, 10193#false, 10194#(= main_~i~2 0), 10195#(<= main_~i~2 1), 10196#(<= main_~i~2 2), 10197#(<= main_~i~2 3), 10198#(<= main_~i~2 4), 10199#(<= main_~i~2 5), 10200#(<= main_~i~2 6), 10201#(<= main_~i~2 7), 10202#(<= main_~i~2 8), 10203#(<= main_~i~2 9), 10204#(<= main_~i~2 10), 10205#(<= main_~i~2 11), 10206#(<= main_~i~2 12), 10207#(<= main_~i~2 13)] [2018-04-12 04:46:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8108 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 7343 trivial. 0 not checked. [2018-04-12 04:46:31,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 04:46:31,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 04:46:31,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-12 04:46:31,361 INFO L87 Difference]: Start difference. First operand 220 states and 237 transitions. Second operand 18 states. [2018-04-12 04:46:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:31,460 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2018-04-12 04:46:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 04:46:31,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 686 [2018-04-12 04:46:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:31,461 INFO L225 Difference]: With dead ends: 232 [2018-04-12 04:46:31,461 INFO L226 Difference]: Without dead ends: 232 [2018-04-12 04:46:31,462 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-12 04:46:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-12 04:46:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-04-12 04:46:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 04:46:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-04-12 04:46:31,466 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 686 [2018-04-12 04:46:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:31,467 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-04-12 04:46:31,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 04:46:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-04-12 04:46:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-04-12 04:46:31,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:31,472 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 29, 29, 29, 29, 29, 29, 29, 29, 29, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:31,473 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash -722079885, now seen corresponding path program 14 times [2018-04-12 04:46:31,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:31,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9324 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 8452 trivial. 0 not checked. [2018-04-12 04:46:32,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:32,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 04:46:32,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-04-12 04:46:32,241 INFO L182 omatonBuilderFactory]: Interpolants [10669#true, 10670#false, 10671#(= main_~i~2 0), 10672#(<= main_~i~2 1), 10673#(<= main_~i~2 2), 10674#(<= main_~i~2 3), 10675#(<= main_~i~2 4), 10676#(<= main_~i~2 5), 10677#(<= main_~i~2 6), 10678#(<= main_~i~2 7), 10679#(<= main_~i~2 8), 10680#(<= main_~i~2 9), 10681#(<= main_~i~2 10), 10682#(<= main_~i~2 11), 10683#(<= main_~i~2 12), 10684#(<= main_~i~2 13), 10685#(<= main_~i~2 14), 10686#(<= main_~i~2 15), 10687#(<= main_~i~2 16)] [2018-04-12 04:46:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9324 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 8452 trivial. 0 not checked. [2018-04-12 04:46:32,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 04:46:32,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 04:46:32,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-12 04:46:32,242 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 19 states. [2018-04-12 04:46:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:32,364 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-04-12 04:46:32,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 04:46:32,364 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 733 [2018-04-12 04:46:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:32,366 INFO L225 Difference]: With dead ends: 239 [2018-04-12 04:46:32,366 INFO L226 Difference]: Without dead ends: 239 [2018-04-12 04:46:32,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-12 04:46:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-12 04:46:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 234. [2018-04-12 04:46:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-12 04:46:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 253 transitions. [2018-04-12 04:46:32,372 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 253 transitions. Word has length 733 [2018-04-12 04:46:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:32,372 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 253 transitions. [2018-04-12 04:46:32,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 04:46:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 253 transitions. [2018-04-12 04:46:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-04-12 04:46:32,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:32,379 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 31, 31, 31, 31, 31, 31, 31, 31, 31, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:32,379 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash 306347405, now seen corresponding path program 15 times [2018-04-12 04:46:32,380 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:32,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10625 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 9639 trivial. 0 not checked. [2018-04-12 04:46:33,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:33,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 04:46:33,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4200 trivial. 0 not checked. [2018-04-12 04:46:33,359 INFO L182 omatonBuilderFactory]: Interpolants [11168#(<= main_~i~2 5), 11169#(<= main_~i~2 6), 11170#(<= main_~i~2 7), 11171#(<= main_~i~2 8), 11172#(<= main_~i~2 9), 11173#(<= main_~i~2 10), 11174#(<= main_~i~2 11), 11175#(<= main_~i~2 12), 11176#(<= main_~i~2 13), 11177#(<= main_~i~2 14), 11178#(<= main_~i~2 15), 11179#(<= main_~i~2 16), 11180#(<= main_~i~2 17), 11161#true, 11162#false, 11163#(= main_~i~2 0), 11164#(<= main_~i~2 1), 11165#(<= main_~i~2 2), 11166#(<= main_~i~2 3), 11167#(<= main_~i~2 4)] [2018-04-12 04:46:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10625 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 9639 trivial. 0 not checked. [2018-04-12 04:46:33,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 04:46:33,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 04:46:33,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-12 04:46:33,360 INFO L87 Difference]: Start difference. First operand 234 states and 253 transitions. Second operand 20 states. [2018-04-12 04:46:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:33,459 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2018-04-12 04:46:33,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 04:46:33,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 780 [2018-04-12 04:46:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:33,461 INFO L225 Difference]: With dead ends: 246 [2018-04-12 04:46:33,461 INFO L226 Difference]: Without dead ends: 246 [2018-04-12 04:46:33,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-12 04:46:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-12 04:46:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-04-12 04:46:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-12 04:46:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 261 transitions. [2018-04-12 04:46:33,466 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 261 transitions. Word has length 780 [2018-04-12 04:46:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:33,466 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 261 transitions. [2018-04-12 04:46:33,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 04:46:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 261 transitions. [2018-04-12 04:46:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-04-12 04:46:33,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:33,472 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 33, 33, 33, 33, 33, 33, 33, 33, 33, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:33,472 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2016108493, now seen corresponding path program 16 times [2018-04-12 04:46:33,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:33,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12011 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 10904 trivial. 0 not checked. [2018-04-12 04:46:34,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:34,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 04:46:34,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [2018-04-12 04:46:34,367 INFO L182 omatonBuilderFactory]: Interpolants [11680#(<= main_~i~2 10), 11681#(<= main_~i~2 11), 11682#(<= main_~i~2 12), 11683#(<= main_~i~2 13), 11684#(<= main_~i~2 14), 11685#(<= main_~i~2 15), 11686#(<= main_~i~2 16), 11687#(<= main_~i~2 17), 11688#(<= main_~i~2 18), 11668#true, 11669#false, 11670#(= main_~i~2 0), 11671#(<= main_~i~2 1), 11672#(<= main_~i~2 2), 11673#(<= main_~i~2 3), 11674#(<= main_~i~2 4), 11675#(<= main_~i~2 5), 11676#(<= main_~i~2 6), 11677#(<= main_~i~2 7), 11678#(<= main_~i~2 8), 11679#(<= main_~i~2 9)] [2018-04-12 04:46:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12011 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 10904 trivial. 0 not checked. [2018-04-12 04:46:34,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 04:46:34,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 04:46:34,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-12 04:46:34,368 INFO L87 Difference]: Start difference. First operand 241 states and 261 transitions. Second operand 21 states. [2018-04-12 04:46:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:34,455 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-04-12 04:46:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 04:46:34,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 827 [2018-04-12 04:46:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:34,456 INFO L225 Difference]: With dead ends: 253 [2018-04-12 04:46:34,457 INFO L226 Difference]: Without dead ends: 253 [2018-04-12 04:46:34,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-12 04:46:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-12 04:46:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2018-04-12 04:46:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-12 04:46:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 269 transitions. [2018-04-12 04:46:34,460 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 269 transitions. Word has length 827 [2018-04-12 04:46:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:34,460 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 269 transitions. [2018-04-12 04:46:34,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 04:46:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 269 transitions. [2018-04-12 04:46:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-12 04:46:34,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:34,464 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 35, 35, 35, 35, 35, 35, 35, 35, 35, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:34,464 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash 652686541, now seen corresponding path program 17 times [2018-04-12 04:46:34,465 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:34,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13482 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 12247 trivial. 0 not checked. [2018-04-12 04:46:35,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:35,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 04:46:35,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5440 trivial. 0 not checked. [2018-04-12 04:46:35,417 INFO L182 omatonBuilderFactory]: Interpolants [12192#(= main_~i~2 0), 12193#(<= main_~i~2 1), 12194#(<= main_~i~2 2), 12195#(<= main_~i~2 3), 12196#(<= main_~i~2 4), 12197#(<= main_~i~2 5), 12198#(<= main_~i~2 6), 12199#(<= main_~i~2 7), 12200#(<= main_~i~2 8), 12201#(<= main_~i~2 9), 12202#(<= main_~i~2 10), 12203#(<= main_~i~2 11), 12204#(<= main_~i~2 12), 12205#(<= main_~i~2 13), 12206#(<= main_~i~2 14), 12207#(<= main_~i~2 15), 12208#(<= main_~i~2 16), 12209#(<= main_~i~2 17), 12210#(<= main_~i~2 18), 12211#(<= main_~i~2 19), 12190#true, 12191#false] [2018-04-12 04:46:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13482 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 12247 trivial. 0 not checked. [2018-04-12 04:46:35,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 04:46:35,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 04:46:35,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-12 04:46:35,418 INFO L87 Difference]: Start difference. First operand 248 states and 269 transitions. Second operand 22 states. [2018-04-12 04:46:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:35,534 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-04-12 04:46:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 04:46:35,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 874 [2018-04-12 04:46:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:35,572 INFO L225 Difference]: With dead ends: 260 [2018-04-12 04:46:35,572 INFO L226 Difference]: Without dead ends: 260 [2018-04-12 04:46:35,572 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-12 04:46:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-12 04:46:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-04-12 04:46:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-12 04:46:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 277 transitions. [2018-04-12 04:46:35,577 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 277 transitions. Word has length 874 [2018-04-12 04:46:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:35,577 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 277 transitions. [2018-04-12 04:46:35,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 04:46:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 277 transitions. [2018-04-12 04:46:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2018-04-12 04:46:35,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:35,581 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 37, 37, 37, 37, 37, 37, 37, 37, 37, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:35,581 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -217087757, now seen corresponding path program 18 times [2018-04-12 04:46:35,582 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:35,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15038 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 13668 trivial. 0 not checked. [2018-04-12 04:46:36,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:36,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 04:46:36,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6120 trivial. 0 not checked. [2018-04-12 04:46:36,882 INFO L182 omatonBuilderFactory]: Interpolants [12736#(<= main_~i~2 7), 12737#(<= main_~i~2 8), 12738#(<= main_~i~2 9), 12739#(<= main_~i~2 10), 12740#(<= main_~i~2 11), 12741#(<= main_~i~2 12), 12742#(<= main_~i~2 13), 12743#(<= main_~i~2 14), 12744#(<= main_~i~2 15), 12745#(<= main_~i~2 16), 12746#(<= main_~i~2 17), 12747#(<= main_~i~2 18), 12748#(<= main_~i~2 19), 12749#(<= main_~i~2 20), 12727#true, 12728#false, 12729#(= main_~i~2 0), 12730#(<= main_~i~2 1), 12731#(<= main_~i~2 2), 12732#(<= main_~i~2 3), 12733#(<= main_~i~2 4), 12734#(<= main_~i~2 5), 12735#(<= main_~i~2 6)] [2018-04-12 04:46:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15038 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 13668 trivial. 0 not checked. [2018-04-12 04:46:36,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 04:46:36,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 04:46:36,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-12 04:46:36,883 INFO L87 Difference]: Start difference. First operand 255 states and 277 transitions. Second operand 23 states. [2018-04-12 04:46:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:36,999 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-04-12 04:46:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 04:46:37,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 921 [2018-04-12 04:46:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:37,001 INFO L225 Difference]: With dead ends: 267 [2018-04-12 04:46:37,001 INFO L226 Difference]: Without dead ends: 267 [2018-04-12 04:46:37,001 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-12 04:46:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-12 04:46:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2018-04-12 04:46:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-12 04:46:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2018-04-12 04:46:37,004 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 921 [2018-04-12 04:46:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:37,004 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2018-04-12 04:46:37,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 04:46:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2018-04-12 04:46:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2018-04-12 04:46:37,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:37,009 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 39, 39, 39, 39, 39, 39, 39, 39, 39, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:37,009 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1375093747, now seen corresponding path program 19 times [2018-04-12 04:46:37,010 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:37,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16679 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 15167 trivial. 0 not checked. [2018-04-12 04:46:38,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:38,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 04:46:38,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6840 trivial. 0 not checked. [2018-04-12 04:46:38,259 INFO L182 omatonBuilderFactory]: Interpolants [13280#false, 13281#(= main_~i~2 0), 13282#(<= main_~i~2 1), 13283#(<= main_~i~2 2), 13284#(<= main_~i~2 3), 13285#(<= main_~i~2 4), 13286#(<= main_~i~2 5), 13287#(<= main_~i~2 6), 13288#(<= main_~i~2 7), 13289#(<= main_~i~2 8), 13290#(<= main_~i~2 9), 13291#(<= main_~i~2 10), 13292#(<= main_~i~2 11), 13293#(<= main_~i~2 12), 13294#(<= main_~i~2 13), 13295#(<= main_~i~2 14), 13296#(<= main_~i~2 15), 13297#(<= main_~i~2 16), 13298#(<= main_~i~2 17), 13299#(<= main_~i~2 18), 13300#(<= main_~i~2 19), 13301#(<= main_~i~2 20), 13302#(<= main_~i~2 21), 13279#true] [2018-04-12 04:46:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16679 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 15167 trivial. 0 not checked. [2018-04-12 04:46:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 04:46:38,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 04:46:38,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-12 04:46:38,260 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand 24 states. [2018-04-12 04:46:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:38,398 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2018-04-12 04:46:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 04:46:38,398 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 968 [2018-04-12 04:46:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:38,399 INFO L225 Difference]: With dead ends: 274 [2018-04-12 04:46:38,399 INFO L226 Difference]: Without dead ends: 274 [2018-04-12 04:46:38,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-12 04:46:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-12 04:46:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2018-04-12 04:46:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-12 04:46:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 293 transitions. [2018-04-12 04:46:38,405 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 293 transitions. Word has length 968 [2018-04-12 04:46:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:38,405 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 293 transitions. [2018-04-12 04:46:38,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 04:46:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 293 transitions. [2018-04-12 04:46:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-04-12 04:46:38,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:38,415 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 41, 41, 41, 41, 41, 41, 41, 41, 41, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:38,415 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1504874931, now seen corresponding path program 20 times [2018-04-12 04:46:38,416 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:38,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18405 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2018-04-12 04:46:39,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:39,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 04:46:39,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7600 trivial. 0 not checked. [2018-04-12 04:46:39,923 INFO L182 omatonBuilderFactory]: Interpolants [13846#true, 13847#false, 13848#(= main_~i~2 0), 13849#(<= main_~i~2 1), 13850#(<= main_~i~2 2), 13851#(<= main_~i~2 3), 13852#(<= main_~i~2 4), 13853#(<= main_~i~2 5), 13854#(<= main_~i~2 6), 13855#(<= main_~i~2 7), 13856#(<= main_~i~2 8), 13857#(<= main_~i~2 9), 13858#(<= main_~i~2 10), 13859#(<= main_~i~2 11), 13860#(<= main_~i~2 12), 13861#(<= main_~i~2 13), 13862#(<= main_~i~2 14), 13863#(<= main_~i~2 15), 13864#(<= main_~i~2 16), 13865#(<= main_~i~2 17), 13866#(<= main_~i~2 18), 13867#(<= main_~i~2 19), 13868#(<= main_~i~2 20), 13869#(<= main_~i~2 21), 13870#(<= main_~i~2 22)] [2018-04-12 04:46:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18405 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2018-04-12 04:46:39,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 04:46:39,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 04:46:39,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-12 04:46:39,924 INFO L87 Difference]: Start difference. First operand 269 states and 293 transitions. Second operand 25 states. [2018-04-12 04:46:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:40,077 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2018-04-12 04:46:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 04:46:40,078 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1015 [2018-04-12 04:46:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:40,079 INFO L225 Difference]: With dead ends: 281 [2018-04-12 04:46:40,079 INFO L226 Difference]: Without dead ends: 281 [2018-04-12 04:46:40,079 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-12 04:46:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-12 04:46:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2018-04-12 04:46:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-12 04:46:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 301 transitions. [2018-04-12 04:46:40,082 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 301 transitions. Word has length 1015 [2018-04-12 04:46:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:40,083 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 301 transitions. [2018-04-12 04:46:40,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 04:46:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 301 transitions. [2018-04-12 04:46:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-04-12 04:46:40,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:40,089 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 43, 43, 43, 43, 43, 43, 43, 43, 43, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:40,089 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1692527795, now seen corresponding path program 21 times [2018-04-12 04:46:40,090 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:40,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 20216 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 18399 trivial. 0 not checked. [2018-04-12 04:46:41,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:41,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 04:46:41,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8400 trivial. 0 not checked. [2018-04-12 04:46:41,652 INFO L182 omatonBuilderFactory]: Interpolants [14428#true, 14429#false, 14430#(= main_~i~2 0), 14431#(<= main_~i~2 1), 14432#(<= main_~i~2 2), 14433#(<= main_~i~2 3), 14434#(<= main_~i~2 4), 14435#(<= main_~i~2 5), 14436#(<= main_~i~2 6), 14437#(<= main_~i~2 7), 14438#(<= main_~i~2 8), 14439#(<= main_~i~2 9), 14440#(<= main_~i~2 10), 14441#(<= main_~i~2 11), 14442#(<= main_~i~2 12), 14443#(<= main_~i~2 13), 14444#(<= main_~i~2 14), 14445#(<= main_~i~2 15), 14446#(<= main_~i~2 16), 14447#(<= main_~i~2 17), 14448#(<= main_~i~2 18), 14449#(<= main_~i~2 19), 14450#(<= main_~i~2 20), 14451#(<= main_~i~2 21), 14452#(<= main_~i~2 22), 14453#(<= main_~i~2 23)] [2018-04-12 04:46:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20216 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 18399 trivial. 0 not checked. [2018-04-12 04:46:41,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 04:46:41,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 04:46:41,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-12 04:46:41,653 INFO L87 Difference]: Start difference. First operand 276 states and 301 transitions. Second operand 26 states. [2018-04-12 04:46:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:41,784 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2018-04-12 04:46:41,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 04:46:41,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1062 [2018-04-12 04:46:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:41,786 INFO L225 Difference]: With dead ends: 288 [2018-04-12 04:46:41,786 INFO L226 Difference]: Without dead ends: 288 [2018-04-12 04:46:41,787 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-12 04:46:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-12 04:46:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-04-12 04:46:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-12 04:46:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2018-04-12 04:46:41,790 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 1062 [2018-04-12 04:46:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:41,790 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2018-04-12 04:46:41,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 04:46:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2018-04-12 04:46:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-04-12 04:46:41,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:41,797 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 45, 45, 45, 45, 45, 45, 45, 45, 45, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:41,797 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1043737997, now seen corresponding path program 22 times [2018-04-12 04:46:41,797 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:41,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22112 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 20132 trivial. 0 not checked. [2018-04-12 04:46:43,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:43,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 04:46:43,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9240 trivial. 0 not checked. [2018-04-12 04:46:43,513 INFO L182 omatonBuilderFactory]: Interpolants [15040#(<= main_~i~2 13), 15041#(<= main_~i~2 14), 15042#(<= main_~i~2 15), 15043#(<= main_~i~2 16), 15044#(<= main_~i~2 17), 15045#(<= main_~i~2 18), 15046#(<= main_~i~2 19), 15047#(<= main_~i~2 20), 15048#(<= main_~i~2 21), 15049#(<= main_~i~2 22), 15050#(<= main_~i~2 23), 15051#(<= main_~i~2 24), 15025#true, 15026#false, 15027#(= main_~i~2 0), 15028#(<= main_~i~2 1), 15029#(<= main_~i~2 2), 15030#(<= main_~i~2 3), 15031#(<= main_~i~2 4), 15032#(<= main_~i~2 5), 15033#(<= main_~i~2 6), 15034#(<= main_~i~2 7), 15035#(<= main_~i~2 8), 15036#(<= main_~i~2 9), 15037#(<= main_~i~2 10), 15038#(<= main_~i~2 11), 15039#(<= main_~i~2 12)] [2018-04-12 04:46:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22112 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 20132 trivial. 0 not checked. [2018-04-12 04:46:43,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 04:46:43,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 04:46:43,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-12 04:46:43,514 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand 27 states. [2018-04-12 04:46:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:43,634 INFO L93 Difference]: Finished difference Result 295 states and 323 transitions. [2018-04-12 04:46:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 04:46:43,634 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1109 [2018-04-12 04:46:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:43,636 INFO L225 Difference]: With dead ends: 295 [2018-04-12 04:46:43,636 INFO L226 Difference]: Without dead ends: 295 [2018-04-12 04:46:43,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-12 04:46:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-12 04:46:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2018-04-12 04:46:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-12 04:46:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 317 transitions. [2018-04-12 04:46:43,639 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 317 transitions. Word has length 1109 [2018-04-12 04:46:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:43,639 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 317 transitions. [2018-04-12 04:46:43,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 04:46:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 317 transitions. [2018-04-12 04:46:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2018-04-12 04:46:43,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:43,646 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 47, 47, 47, 47, 47, 47, 47, 47, 47, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:43,646 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1097319795, now seen corresponding path program 23 times [2018-04-12 04:46:43,647 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:43,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24093 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 21943 trivial. 0 not checked. [2018-04-12 04:46:45,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:45,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 04:46:45,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10120 trivial. 0 not checked. [2018-04-12 04:46:45,565 INFO L182 omatonBuilderFactory]: Interpolants [15637#true, 15638#false, 15639#(= main_~i~2 0), 15640#(<= main_~i~2 1), 15641#(<= main_~i~2 2), 15642#(<= main_~i~2 3), 15643#(<= main_~i~2 4), 15644#(<= main_~i~2 5), 15645#(<= main_~i~2 6), 15646#(<= main_~i~2 7), 15647#(<= main_~i~2 8), 15648#(<= main_~i~2 9), 15649#(<= main_~i~2 10), 15650#(<= main_~i~2 11), 15651#(<= main_~i~2 12), 15652#(<= main_~i~2 13), 15653#(<= main_~i~2 14), 15654#(<= main_~i~2 15), 15655#(<= main_~i~2 16), 15656#(<= main_~i~2 17), 15657#(<= main_~i~2 18), 15658#(<= main_~i~2 19), 15659#(<= main_~i~2 20), 15660#(<= main_~i~2 21), 15661#(<= main_~i~2 22), 15662#(<= main_~i~2 23), 15663#(<= main_~i~2 24), 15664#(<= main_~i~2 25)] [2018-04-12 04:46:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24093 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 21943 trivial. 0 not checked. [2018-04-12 04:46:45,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 04:46:45,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 04:46:45,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-12 04:46:45,566 INFO L87 Difference]: Start difference. First operand 290 states and 317 transitions. Second operand 28 states. [2018-04-12 04:46:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:45,762 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2018-04-12 04:46:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 04:46:45,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1156 [2018-04-12 04:46:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:45,763 INFO L225 Difference]: With dead ends: 302 [2018-04-12 04:46:45,764 INFO L226 Difference]: Without dead ends: 302 [2018-04-12 04:46:45,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-12 04:46:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-12 04:46:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2018-04-12 04:46:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-12 04:46:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-04-12 04:46:45,768 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 1156 [2018-04-12 04:46:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:45,769 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-04-12 04:46:45,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 04:46:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-04-12 04:46:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-04-12 04:46:45,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:45,776 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 49, 49, 49, 49, 49, 49, 49, 49, 49, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:45,776 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1268694221, now seen corresponding path program 24 times [2018-04-12 04:46:45,777 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:45,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 26159 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 23832 trivial. 0 not checked. [2018-04-12 04:46:47,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:47,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-12 04:46:47,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11040 trivial. 0 not checked. [2018-04-12 04:46:47,839 INFO L182 omatonBuilderFactory]: Interpolants [16264#true, 16265#false, 16266#(= main_~i~2 0), 16267#(<= main_~i~2 1), 16268#(<= main_~i~2 2), 16269#(<= main_~i~2 3), 16270#(<= main_~i~2 4), 16271#(<= main_~i~2 5), 16272#(<= main_~i~2 6), 16273#(<= main_~i~2 7), 16274#(<= main_~i~2 8), 16275#(<= main_~i~2 9), 16276#(<= main_~i~2 10), 16277#(<= main_~i~2 11), 16278#(<= main_~i~2 12), 16279#(<= main_~i~2 13), 16280#(<= main_~i~2 14), 16281#(<= main_~i~2 15), 16282#(<= main_~i~2 16), 16283#(<= main_~i~2 17), 16284#(<= main_~i~2 18), 16285#(<= main_~i~2 19), 16286#(<= main_~i~2 20), 16287#(<= main_~i~2 21), 16288#(<= main_~i~2 22), 16289#(<= main_~i~2 23), 16290#(<= main_~i~2 24), 16291#(<= main_~i~2 25), 16292#(<= main_~i~2 26)] [2018-04-12 04:46:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 26159 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 23832 trivial. 0 not checked. [2018-04-12 04:46:47,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 04:46:47,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 04:46:47,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-12 04:46:47,840 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 29 states. [2018-04-12 04:46:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:48,025 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2018-04-12 04:46:48,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 04:46:48,025 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1203 [2018-04-12 04:46:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:48,027 INFO L225 Difference]: With dead ends: 309 [2018-04-12 04:46:48,027 INFO L226 Difference]: Without dead ends: 309 [2018-04-12 04:46:48,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-12 04:46:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-12 04:46:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2018-04-12 04:46:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-12 04:46:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 333 transitions. [2018-04-12 04:46:48,031 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 333 transitions. Word has length 1203 [2018-04-12 04:46:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:48,031 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 333 transitions. [2018-04-12 04:46:48,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 04:46:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 333 transitions. [2018-04-12 04:46:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2018-04-12 04:46:48,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:48,038 INFO L355 BasicCegarLoop]: trace histogram [78, 78, 51, 51, 51, 51, 51, 51, 51, 51, 51, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:48,038 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 99365325, now seen corresponding path program 25 times [2018-04-12 04:46:48,039 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:48,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 28310 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 25799 trivial. 0 not checked. [2018-04-12 04:46:50,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:50,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 04:46:50,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12000 trivial. 0 not checked. [2018-04-12 04:46:50,168 INFO L182 omatonBuilderFactory]: Interpolants [16906#true, 16907#false, 16908#(= main_~i~2 0), 16909#(<= main_~i~2 1), 16910#(<= main_~i~2 2), 16911#(<= main_~i~2 3), 16912#(<= main_~i~2 4), 16913#(<= main_~i~2 5), 16914#(<= main_~i~2 6), 16915#(<= main_~i~2 7), 16916#(<= main_~i~2 8), 16917#(<= main_~i~2 9), 16918#(<= main_~i~2 10), 16919#(<= main_~i~2 11), 16920#(<= main_~i~2 12), 16921#(<= main_~i~2 13), 16922#(<= main_~i~2 14), 16923#(<= main_~i~2 15), 16924#(<= main_~i~2 16), 16925#(<= main_~i~2 17), 16926#(<= main_~i~2 18), 16927#(<= main_~i~2 19), 16928#(<= main_~i~2 20), 16929#(<= main_~i~2 21), 16930#(<= main_~i~2 22), 16931#(<= main_~i~2 23), 16932#(<= main_~i~2 24), 16933#(<= main_~i~2 25), 16934#(<= main_~i~2 26), 16935#(<= main_~i~2 27)] [2018-04-12 04:46:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28310 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 25799 trivial. 0 not checked. [2018-04-12 04:46:50,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 04:46:50,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 04:46:50,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-12 04:46:50,169 INFO L87 Difference]: Start difference. First operand 304 states and 333 transitions. Second operand 30 states. [2018-04-12 04:46:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:50,360 INFO L93 Difference]: Finished difference Result 316 states and 347 transitions. [2018-04-12 04:46:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 04:46:50,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1250 [2018-04-12 04:46:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:50,361 INFO L225 Difference]: With dead ends: 316 [2018-04-12 04:46:50,361 INFO L226 Difference]: Without dead ends: 316 [2018-04-12 04:46:50,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-12 04:46:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-12 04:46:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2018-04-12 04:46:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-12 04:46:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-04-12 04:46:50,367 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 1250 [2018-04-12 04:46:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:50,367 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-04-12 04:46:50,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 04:46:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-04-12 04:46:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-04-12 04:46:50,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:50,380 INFO L355 BasicCegarLoop]: trace histogram [81, 81, 53, 53, 53, 53, 53, 53, 53, 53, 53, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:50,380 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -41622541, now seen corresponding path program 26 times [2018-04-12 04:46:50,381 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:50,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30546 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 27844 trivial. 0 not checked. [2018-04-12 04:46:53,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:53,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-12 04:46:53,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13000 trivial. 0 not checked. [2018-04-12 04:46:53,020 INFO L182 omatonBuilderFactory]: Interpolants [17563#true, 17564#false, 17565#(= main_~i~2 0), 17566#(<= main_~i~2 1), 17567#(<= main_~i~2 2), 17568#(<= main_~i~2 3), 17569#(<= main_~i~2 4), 17570#(<= main_~i~2 5), 17571#(<= main_~i~2 6), 17572#(<= main_~i~2 7), 17573#(<= main_~i~2 8), 17574#(<= main_~i~2 9), 17575#(<= main_~i~2 10), 17576#(<= main_~i~2 11), 17577#(<= main_~i~2 12), 17578#(<= main_~i~2 13), 17579#(<= main_~i~2 14), 17580#(<= main_~i~2 15), 17581#(<= main_~i~2 16), 17582#(<= main_~i~2 17), 17583#(<= main_~i~2 18), 17584#(<= main_~i~2 19), 17585#(<= main_~i~2 20), 17586#(<= main_~i~2 21), 17587#(<= main_~i~2 22), 17588#(<= main_~i~2 23), 17589#(<= main_~i~2 24), 17590#(<= main_~i~2 25), 17591#(<= main_~i~2 26), 17592#(<= main_~i~2 27), 17593#(<= main_~i~2 28)] [2018-04-12 04:46:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30546 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 27844 trivial. 0 not checked. [2018-04-12 04:46:53,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 04:46:53,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 04:46:53,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-12 04:46:53,021 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 31 states. [2018-04-12 04:46:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:53,239 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-04-12 04:46:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 04:46:53,239 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1297 [2018-04-12 04:46:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:53,240 INFO L225 Difference]: With dead ends: 323 [2018-04-12 04:46:53,240 INFO L226 Difference]: Without dead ends: 323 [2018-04-12 04:46:53,241 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-12 04:46:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-12 04:46:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2018-04-12 04:46:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-12 04:46:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 349 transitions. [2018-04-12 04:46:53,245 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 349 transitions. Word has length 1297 [2018-04-12 04:46:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:53,245 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 349 transitions. [2018-04-12 04:46:53,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 04:46:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 349 transitions. [2018-04-12 04:46:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2018-04-12 04:46:53,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:53,253 INFO L355 BasicCegarLoop]: trace histogram [84, 84, 55, 55, 55, 55, 55, 55, 55, 55, 55, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:53,254 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:53,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1148323571, now seen corresponding path program 27 times [2018-04-12 04:46:53,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:53,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32867 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 29967 trivial. 0 not checked. [2018-04-12 04:46:56,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:56,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 04:46:56,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14040 trivial. 0 not checked. [2018-04-12 04:46:56,007 INFO L182 omatonBuilderFactory]: Interpolants [18240#(<= main_~i~2 3), 18241#(<= main_~i~2 4), 18242#(<= main_~i~2 5), 18243#(<= main_~i~2 6), 18244#(<= main_~i~2 7), 18245#(<= main_~i~2 8), 18246#(<= main_~i~2 9), 18247#(<= main_~i~2 10), 18248#(<= main_~i~2 11), 18249#(<= main_~i~2 12), 18250#(<= main_~i~2 13), 18251#(<= main_~i~2 14), 18252#(<= main_~i~2 15), 18253#(<= main_~i~2 16), 18254#(<= main_~i~2 17), 18255#(<= main_~i~2 18), 18256#(<= main_~i~2 19), 18257#(<= main_~i~2 20), 18258#(<= main_~i~2 21), 18259#(<= main_~i~2 22), 18260#(<= main_~i~2 23), 18261#(<= main_~i~2 24), 18262#(<= main_~i~2 25), 18263#(<= main_~i~2 26), 18264#(<= main_~i~2 27), 18265#(<= main_~i~2 28), 18266#(<= main_~i~2 29), 18235#true, 18236#false, 18237#(= main_~i~2 0), 18238#(<= main_~i~2 1), 18239#(<= main_~i~2 2)] [2018-04-12 04:46:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32867 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 29967 trivial. 0 not checked. [2018-04-12 04:46:56,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 04:46:56,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 04:46:56,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-12 04:46:56,008 INFO L87 Difference]: Start difference. First operand 318 states and 349 transitions. Second operand 32 states. [2018-04-12 04:46:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:56,362 INFO L93 Difference]: Finished difference Result 330 states and 363 transitions. [2018-04-12 04:46:56,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 04:46:56,363 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1344 [2018-04-12 04:46:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:56,365 INFO L225 Difference]: With dead ends: 330 [2018-04-12 04:46:56,365 INFO L226 Difference]: Without dead ends: 330 [2018-04-12 04:46:56,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-12 04:46:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-12 04:46:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2018-04-12 04:46:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-12 04:46:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 357 transitions. [2018-04-12 04:46:56,372 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 357 transitions. Word has length 1344 [2018-04-12 04:46:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:56,373 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 357 transitions. [2018-04-12 04:46:56,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 04:46:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 357 transitions. [2018-04-12 04:46:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1392 [2018-04-12 04:46:56,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:56,388 INFO L355 BasicCegarLoop]: trace histogram [87, 87, 57, 57, 57, 57, 57, 57, 57, 57, 57, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:56,388 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1816179891, now seen corresponding path program 28 times [2018-04-12 04:46:56,389 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:56,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:46:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35273 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 32168 trivial. 0 not checked. [2018-04-12 04:46:59,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:46:59,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-12 04:46:59,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:46:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15120 trivial. 0 not checked. [2018-04-12 04:46:59,608 INFO L182 omatonBuilderFactory]: Interpolants [18944#(<= main_~i~2 20), 18945#(<= main_~i~2 21), 18946#(<= main_~i~2 22), 18947#(<= main_~i~2 23), 18948#(<= main_~i~2 24), 18949#(<= main_~i~2 25), 18950#(<= main_~i~2 26), 18951#(<= main_~i~2 27), 18952#(<= main_~i~2 28), 18953#(<= main_~i~2 29), 18954#(<= main_~i~2 30), 18922#true, 18923#false, 18924#(= main_~i~2 0), 18925#(<= main_~i~2 1), 18926#(<= main_~i~2 2), 18927#(<= main_~i~2 3), 18928#(<= main_~i~2 4), 18929#(<= main_~i~2 5), 18930#(<= main_~i~2 6), 18931#(<= main_~i~2 7), 18932#(<= main_~i~2 8), 18933#(<= main_~i~2 9), 18934#(<= main_~i~2 10), 18935#(<= main_~i~2 11), 18936#(<= main_~i~2 12), 18937#(<= main_~i~2 13), 18938#(<= main_~i~2 14), 18939#(<= main_~i~2 15), 18940#(<= main_~i~2 16), 18941#(<= main_~i~2 17), 18942#(<= main_~i~2 18), 18943#(<= main_~i~2 19)] [2018-04-12 04:46:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 35273 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 32168 trivial. 0 not checked. [2018-04-12 04:46:59,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 04:46:59,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 04:46:59,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 04:46:59,610 INFO L87 Difference]: Start difference. First operand 325 states and 357 transitions. Second operand 33 states. [2018-04-12 04:46:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:46:59,774 INFO L93 Difference]: Finished difference Result 337 states and 371 transitions. [2018-04-12 04:46:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 04:46:59,774 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1391 [2018-04-12 04:46:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:46:59,776 INFO L225 Difference]: With dead ends: 337 [2018-04-12 04:46:59,776 INFO L226 Difference]: Without dead ends: 337 [2018-04-12 04:46:59,776 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 04:46:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-12 04:46:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2018-04-12 04:46:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-04-12 04:46:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 365 transitions. [2018-04-12 04:46:59,781 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 365 transitions. Word has length 1391 [2018-04-12 04:46:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:46:59,781 INFO L459 AbstractCegarLoop]: Abstraction has 332 states and 365 transitions. [2018-04-12 04:46:59,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 04:46:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 365 transitions. [2018-04-12 04:46:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1439 [2018-04-12 04:46:59,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:46:59,793 INFO L355 BasicCegarLoop]: trace histogram [90, 90, 59, 59, 59, 59, 59, 59, 59, 59, 59, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:46:59,793 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:46:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash -957247411, now seen corresponding path program 29 times [2018-04-12 04:46:59,794 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:46:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:46:59,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 37764 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 34447 trivial. 0 not checked. [2018-04-12 04:47:03,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:03,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 04:47:03,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2018-04-12 04:47:03,090 INFO L182 omatonBuilderFactory]: Interpolants [19648#(<= main_~i~2 22), 19649#(<= main_~i~2 23), 19650#(<= main_~i~2 24), 19651#(<= main_~i~2 25), 19652#(<= main_~i~2 26), 19653#(<= main_~i~2 27), 19654#(<= main_~i~2 28), 19655#(<= main_~i~2 29), 19656#(<= main_~i~2 30), 19657#(<= main_~i~2 31), 19624#true, 19625#false, 19626#(= main_~i~2 0), 19627#(<= main_~i~2 1), 19628#(<= main_~i~2 2), 19629#(<= main_~i~2 3), 19630#(<= main_~i~2 4), 19631#(<= main_~i~2 5), 19632#(<= main_~i~2 6), 19633#(<= main_~i~2 7), 19634#(<= main_~i~2 8), 19635#(<= main_~i~2 9), 19636#(<= main_~i~2 10), 19637#(<= main_~i~2 11), 19638#(<= main_~i~2 12), 19639#(<= main_~i~2 13), 19640#(<= main_~i~2 14), 19641#(<= main_~i~2 15), 19642#(<= main_~i~2 16), 19643#(<= main_~i~2 17), 19644#(<= main_~i~2 18), 19645#(<= main_~i~2 19), 19646#(<= main_~i~2 20), 19647#(<= main_~i~2 21)] [2018-04-12 04:47:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 37764 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 34447 trivial. 0 not checked. [2018-04-12 04:47:03,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 04:47:03,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 04:47:03,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 04:47:03,091 INFO L87 Difference]: Start difference. First operand 332 states and 365 transitions. Second operand 34 states. [2018-04-12 04:47:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:03,285 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-04-12 04:47:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 04:47:03,285 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1438 [2018-04-12 04:47:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:03,287 INFO L225 Difference]: With dead ends: 344 [2018-04-12 04:47:03,287 INFO L226 Difference]: Without dead ends: 344 [2018-04-12 04:47:03,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 04:47:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-12 04:47:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2018-04-12 04:47:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-12 04:47:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 373 transitions. [2018-04-12 04:47:03,291 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 373 transitions. Word has length 1438 [2018-04-12 04:47:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:03,291 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 373 transitions. [2018-04-12 04:47:03,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 04:47:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 373 transitions. [2018-04-12 04:47:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-04-12 04:47:03,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:03,301 INFO L355 BasicCegarLoop]: trace histogram [93, 93, 61, 61, 61, 61, 61, 61, 61, 61, 61, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:03,301 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1834961549, now seen corresponding path program 30 times [2018-04-12 04:47:03,301 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:03,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 40340 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 36804 trivial. 0 not checked. [2018-04-12 04:47:06,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:06,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-12 04:47:06,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 17400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17400 trivial. 0 not checked. [2018-04-12 04:47:06,810 INFO L182 omatonBuilderFactory]: Interpolants [20352#(<= main_~i~2 9), 20353#(<= main_~i~2 10), 20354#(<= main_~i~2 11), 20355#(<= main_~i~2 12), 20356#(<= main_~i~2 13), 20357#(<= main_~i~2 14), 20358#(<= main_~i~2 15), 20359#(<= main_~i~2 16), 20360#(<= main_~i~2 17), 20361#(<= main_~i~2 18), 20362#(<= main_~i~2 19), 20363#(<= main_~i~2 20), 20364#(<= main_~i~2 21), 20365#(<= main_~i~2 22), 20366#(<= main_~i~2 23), 20367#(<= main_~i~2 24), 20368#(<= main_~i~2 25), 20369#(<= main_~i~2 26), 20370#(<= main_~i~2 27), 20371#(<= main_~i~2 28), 20372#(<= main_~i~2 29), 20373#(<= main_~i~2 30), 20374#(<= main_~i~2 31), 20375#(<= main_~i~2 32), 20341#true, 20342#false, 20343#(= main_~i~2 0), 20344#(<= main_~i~2 1), 20345#(<= main_~i~2 2), 20346#(<= main_~i~2 3), 20347#(<= main_~i~2 4), 20348#(<= main_~i~2 5), 20349#(<= main_~i~2 6), 20350#(<= main_~i~2 7), 20351#(<= main_~i~2 8)] [2018-04-12 04:47:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 40340 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 36804 trivial. 0 not checked. [2018-04-12 04:47:06,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 04:47:06,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 04:47:06,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 04:47:06,811 INFO L87 Difference]: Start difference. First operand 339 states and 373 transitions. Second operand 35 states. [2018-04-12 04:47:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:06,999 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-04-12 04:47:06,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 04:47:06,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1485 [2018-04-12 04:47:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:07,001 INFO L225 Difference]: With dead ends: 351 [2018-04-12 04:47:07,001 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 04:47:07,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 04:47:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 04:47:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2018-04-12 04:47:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-12 04:47:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 381 transitions. [2018-04-12 04:47:07,005 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 381 transitions. Word has length 1485 [2018-04-12 04:47:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:07,006 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 381 transitions. [2018-04-12 04:47:07,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 04:47:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 381 transitions. [2018-04-12 04:47:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-04-12 04:47:07,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:07,019 INFO L355 BasicCegarLoop]: trace histogram [96, 96, 63, 63, 63, 63, 63, 63, 63, 63, 63, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:07,019 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash -326436979, now seen corresponding path program 31 times [2018-04-12 04:47:07,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:07,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 43001 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 39239 trivial. 0 not checked. [2018-04-12 04:47:10,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:10,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 04:47:10,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18600 trivial. 0 not checked. [2018-04-12 04:47:10,896 INFO L182 omatonBuilderFactory]: Interpolants [21073#true, 21074#false, 21075#(= main_~i~2 0), 21076#(<= main_~i~2 1), 21077#(<= main_~i~2 2), 21078#(<= main_~i~2 3), 21079#(<= main_~i~2 4), 21080#(<= main_~i~2 5), 21081#(<= main_~i~2 6), 21082#(<= main_~i~2 7), 21083#(<= main_~i~2 8), 21084#(<= main_~i~2 9), 21085#(<= main_~i~2 10), 21086#(<= main_~i~2 11), 21087#(<= main_~i~2 12), 21088#(<= main_~i~2 13), 21089#(<= main_~i~2 14), 21090#(<= main_~i~2 15), 21091#(<= main_~i~2 16), 21092#(<= main_~i~2 17), 21093#(<= main_~i~2 18), 21094#(<= main_~i~2 19), 21095#(<= main_~i~2 20), 21096#(<= main_~i~2 21), 21097#(<= main_~i~2 22), 21098#(<= main_~i~2 23), 21099#(<= main_~i~2 24), 21100#(<= main_~i~2 25), 21101#(<= main_~i~2 26), 21102#(<= main_~i~2 27), 21103#(<= main_~i~2 28), 21104#(<= main_~i~2 29), 21105#(<= main_~i~2 30), 21106#(<= main_~i~2 31), 21107#(<= main_~i~2 32), 21108#(<= main_~i~2 33)] [2018-04-12 04:47:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 43001 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 39239 trivial. 0 not checked. [2018-04-12 04:47:10,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-12 04:47:10,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-12 04:47:10,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 04:47:10,898 INFO L87 Difference]: Start difference. First operand 346 states and 381 transitions. Second operand 36 states. [2018-04-12 04:47:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:11,146 INFO L93 Difference]: Finished difference Result 358 states and 395 transitions. [2018-04-12 04:47:11,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 04:47:11,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1532 [2018-04-12 04:47:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:11,148 INFO L225 Difference]: With dead ends: 358 [2018-04-12 04:47:11,148 INFO L226 Difference]: Without dead ends: 358 [2018-04-12 04:47:11,148 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 04:47:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-12 04:47:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2018-04-12 04:47:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-12 04:47:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 389 transitions. [2018-04-12 04:47:11,152 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 389 transitions. Word has length 1532 [2018-04-12 04:47:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:11,152 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 389 transitions. [2018-04-12 04:47:11,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-12 04:47:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2018-04-12 04:47:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2018-04-12 04:47:11,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:11,163 INFO L355 BasicCegarLoop]: trace histogram [99, 99, 65, 65, 65, 65, 65, 65, 65, 65, 65, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:11,163 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2052004301, now seen corresponding path program 32 times [2018-04-12 04:47:11,164 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:11,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 45747 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 41752 trivial. 0 not checked. [2018-04-12 04:47:15,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:15,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-12 04:47:15,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19840 trivial. 0 not checked. [2018-04-12 04:47:15,368 INFO L182 omatonBuilderFactory]: Interpolants [21824#(<= main_~i~2 2), 21825#(<= main_~i~2 3), 21826#(<= main_~i~2 4), 21827#(<= main_~i~2 5), 21828#(<= main_~i~2 6), 21829#(<= main_~i~2 7), 21830#(<= main_~i~2 8), 21831#(<= main_~i~2 9), 21832#(<= main_~i~2 10), 21833#(<= main_~i~2 11), 21834#(<= main_~i~2 12), 21835#(<= main_~i~2 13), 21836#(<= main_~i~2 14), 21837#(<= main_~i~2 15), 21838#(<= main_~i~2 16), 21839#(<= main_~i~2 17), 21840#(<= main_~i~2 18), 21841#(<= main_~i~2 19), 21842#(<= main_~i~2 20), 21843#(<= main_~i~2 21), 21844#(<= main_~i~2 22), 21845#(<= main_~i~2 23), 21846#(<= main_~i~2 24), 21847#(<= main_~i~2 25), 21848#(<= main_~i~2 26), 21849#(<= main_~i~2 27), 21850#(<= main_~i~2 28), 21851#(<= main_~i~2 29), 21852#(<= main_~i~2 30), 21853#(<= main_~i~2 31), 21854#(<= main_~i~2 32), 21855#(<= main_~i~2 33), 21856#(<= main_~i~2 34), 21820#true, 21821#false, 21822#(= main_~i~2 0), 21823#(<= main_~i~2 1)] [2018-04-12 04:47:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 45747 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 41752 trivial. 0 not checked. [2018-04-12 04:47:15,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 04:47:15,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 04:47:15,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 04:47:15,369 INFO L87 Difference]: Start difference. First operand 353 states and 389 transitions. Second operand 37 states. [2018-04-12 04:47:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:15,622 INFO L93 Difference]: Finished difference Result 365 states and 403 transitions. [2018-04-12 04:47:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 04:47:15,622 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1579 [2018-04-12 04:47:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:15,624 INFO L225 Difference]: With dead ends: 365 [2018-04-12 04:47:15,624 INFO L226 Difference]: Without dead ends: 365 [2018-04-12 04:47:15,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 04:47:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-12 04:47:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 360. [2018-04-12 04:47:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-12 04:47:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 397 transitions. [2018-04-12 04:47:15,628 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 397 transitions. Word has length 1579 [2018-04-12 04:47:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:15,628 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 397 transitions. [2018-04-12 04:47:15,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 04:47:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 397 transitions. [2018-04-12 04:47:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1627 [2018-04-12 04:47:15,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:15,639 INFO L355 BasicCegarLoop]: trace histogram [102, 102, 67, 67, 67, 67, 67, 67, 67, 67, 67, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:15,639 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 231616205, now seen corresponding path program 33 times [2018-04-12 04:47:15,640 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:15,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 48578 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 44343 trivial. 0 not checked. [2018-04-12 04:47:20,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:20,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 04:47:20,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21120 trivial. 0 not checked. [2018-04-12 04:47:20,037 INFO L182 omatonBuilderFactory]: Interpolants [22592#(<= main_~i~2 8), 22593#(<= main_~i~2 9), 22594#(<= main_~i~2 10), 22595#(<= main_~i~2 11), 22596#(<= main_~i~2 12), 22597#(<= main_~i~2 13), 22598#(<= main_~i~2 14), 22599#(<= main_~i~2 15), 22600#(<= main_~i~2 16), 22601#(<= main_~i~2 17), 22602#(<= main_~i~2 18), 22603#(<= main_~i~2 19), 22604#(<= main_~i~2 20), 22605#(<= main_~i~2 21), 22606#(<= main_~i~2 22), 22607#(<= main_~i~2 23), 22608#(<= main_~i~2 24), 22609#(<= main_~i~2 25), 22610#(<= main_~i~2 26), 22611#(<= main_~i~2 27), 22612#(<= main_~i~2 28), 22613#(<= main_~i~2 29), 22614#(<= main_~i~2 30), 22615#(<= main_~i~2 31), 22616#(<= main_~i~2 32), 22617#(<= main_~i~2 33), 22618#(<= main_~i~2 34), 22619#(<= main_~i~2 35), 22582#true, 22583#false, 22584#(= main_~i~2 0), 22585#(<= main_~i~2 1), 22586#(<= main_~i~2 2), 22587#(<= main_~i~2 3), 22588#(<= main_~i~2 4), 22589#(<= main_~i~2 5), 22590#(<= main_~i~2 6), 22591#(<= main_~i~2 7)] [2018-04-12 04:47:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 48578 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 44343 trivial. 0 not checked. [2018-04-12 04:47:20,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 04:47:20,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 04:47:20,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 04:47:20,038 INFO L87 Difference]: Start difference. First operand 360 states and 397 transitions. Second operand 38 states. [2018-04-12 04:47:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:20,259 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2018-04-12 04:47:20,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 04:47:20,260 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1626 [2018-04-12 04:47:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:20,261 INFO L225 Difference]: With dead ends: 372 [2018-04-12 04:47:20,261 INFO L226 Difference]: Without dead ends: 372 [2018-04-12 04:47:20,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 04:47:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-12 04:47:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2018-04-12 04:47:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-12 04:47:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2018-04-12 04:47:20,265 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 1626 [2018-04-12 04:47:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:20,265 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2018-04-12 04:47:20,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 04:47:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2018-04-12 04:47:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1674 [2018-04-12 04:47:20,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:20,277 INFO L355 BasicCegarLoop]: trace histogram [105, 105, 69, 69, 69, 69, 69, 69, 69, 69, 69, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:20,277 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1652734221, now seen corresponding path program 34 times [2018-04-12 04:47:20,278 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:20,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 51494 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 47012 trivial. 0 not checked. [2018-04-12 04:47:24,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:24,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-12 04:47:24,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22440 trivial. 0 not checked. [2018-04-12 04:47:24,928 INFO L182 omatonBuilderFactory]: Interpolants [23360#false, 23361#(= main_~i~2 0), 23362#(<= main_~i~2 1), 23363#(<= main_~i~2 2), 23364#(<= main_~i~2 3), 23365#(<= main_~i~2 4), 23366#(<= main_~i~2 5), 23367#(<= main_~i~2 6), 23368#(<= main_~i~2 7), 23369#(<= main_~i~2 8), 23370#(<= main_~i~2 9), 23371#(<= main_~i~2 10), 23372#(<= main_~i~2 11), 23373#(<= main_~i~2 12), 23374#(<= main_~i~2 13), 23375#(<= main_~i~2 14), 23376#(<= main_~i~2 15), 23377#(<= main_~i~2 16), 23378#(<= main_~i~2 17), 23379#(<= main_~i~2 18), 23380#(<= main_~i~2 19), 23381#(<= main_~i~2 20), 23382#(<= main_~i~2 21), 23383#(<= main_~i~2 22), 23384#(<= main_~i~2 23), 23385#(<= main_~i~2 24), 23386#(<= main_~i~2 25), 23387#(<= main_~i~2 26), 23388#(<= main_~i~2 27), 23389#(<= main_~i~2 28), 23390#(<= main_~i~2 29), 23391#(<= main_~i~2 30), 23392#(<= main_~i~2 31), 23393#(<= main_~i~2 32), 23394#(<= main_~i~2 33), 23395#(<= main_~i~2 34), 23396#(<= main_~i~2 35), 23397#(<= main_~i~2 36), 23359#true] [2018-04-12 04:47:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 51494 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 47012 trivial. 0 not checked. [2018-04-12 04:47:24,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 04:47:24,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 04:47:24,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 04:47:24,929 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand 39 states. [2018-04-12 04:47:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:25,200 INFO L93 Difference]: Finished difference Result 379 states and 419 transitions. [2018-04-12 04:47:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 04:47:25,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1673 [2018-04-12 04:47:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:25,202 INFO L225 Difference]: With dead ends: 379 [2018-04-12 04:47:25,202 INFO L226 Difference]: Without dead ends: 379 [2018-04-12 04:47:25,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 04:47:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-12 04:47:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 374. [2018-04-12 04:47:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-12 04:47:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 413 transitions. [2018-04-12 04:47:25,206 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 413 transitions. Word has length 1673 [2018-04-12 04:47:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:25,207 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 413 transitions. [2018-04-12 04:47:25,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 04:47:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 413 transitions. [2018-04-12 04:47:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2018-04-12 04:47:25,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:25,219 INFO L355 BasicCegarLoop]: trace histogram [108, 108, 71, 71, 71, 71, 71, 71, 71, 71, 71, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:25,219 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1764701709, now seen corresponding path program 35 times [2018-04-12 04:47:25,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:25,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 54495 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 49759 trivial. 0 not checked. [2018-04-12 04:47:30,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:30,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 04:47:30,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23800 trivial. 0 not checked. [2018-04-12 04:47:30,388 INFO L182 omatonBuilderFactory]: Interpolants [24151#true, 24152#false, 24153#(= main_~i~2 0), 24154#(<= main_~i~2 1), 24155#(<= main_~i~2 2), 24156#(<= main_~i~2 3), 24157#(<= main_~i~2 4), 24158#(<= main_~i~2 5), 24159#(<= main_~i~2 6), 24160#(<= main_~i~2 7), 24161#(<= main_~i~2 8), 24162#(<= main_~i~2 9), 24163#(<= main_~i~2 10), 24164#(<= main_~i~2 11), 24165#(<= main_~i~2 12), 24166#(<= main_~i~2 13), 24167#(<= main_~i~2 14), 24168#(<= main_~i~2 15), 24169#(<= main_~i~2 16), 24170#(<= main_~i~2 17), 24171#(<= main_~i~2 18), 24172#(<= main_~i~2 19), 24173#(<= main_~i~2 20), 24174#(<= main_~i~2 21), 24175#(<= main_~i~2 22), 24176#(<= main_~i~2 23), 24177#(<= main_~i~2 24), 24178#(<= main_~i~2 25), 24179#(<= main_~i~2 26), 24180#(<= main_~i~2 27), 24181#(<= main_~i~2 28), 24182#(<= main_~i~2 29), 24183#(<= main_~i~2 30), 24184#(<= main_~i~2 31), 24185#(<= main_~i~2 32), 24186#(<= main_~i~2 33), 24187#(<= main_~i~2 34), 24188#(<= main_~i~2 35), 24189#(<= main_~i~2 36), 24190#(<= main_~i~2 37)] [2018-04-12 04:47:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 54495 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 49759 trivial. 0 not checked. [2018-04-12 04:47:30,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 04:47:30,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 04:47:30,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 04:47:30,390 INFO L87 Difference]: Start difference. First operand 374 states and 413 transitions. Second operand 40 states. [2018-04-12 04:47:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:30,679 INFO L93 Difference]: Finished difference Result 386 states and 427 transitions. [2018-04-12 04:47:30,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 04:47:30,679 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1720 [2018-04-12 04:47:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:30,681 INFO L225 Difference]: With dead ends: 386 [2018-04-12 04:47:30,681 INFO L226 Difference]: Without dead ends: 386 [2018-04-12 04:47:30,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 04:47:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-12 04:47:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2018-04-12 04:47:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-12 04:47:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 421 transitions. [2018-04-12 04:47:30,687 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 421 transitions. Word has length 1720 [2018-04-12 04:47:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:30,688 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 421 transitions. [2018-04-12 04:47:30,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 04:47:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 421 transitions. [2018-04-12 04:47:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2018-04-12 04:47:30,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:30,709 INFO L355 BasicCegarLoop]: trace histogram [111, 111, 73, 73, 73, 73, 73, 73, 73, 73, 73, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:30,709 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 890361779, now seen corresponding path program 36 times [2018-04-12 04:47:30,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:30,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 57581 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 52584 trivial. 0 not checked. [2018-04-12 04:47:36,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:36,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-12 04:47:36,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25200 trivial. 0 not checked. [2018-04-12 04:47:36,254 INFO L182 omatonBuilderFactory]: Interpolants [24960#(= main_~i~2 0), 24961#(<= main_~i~2 1), 24962#(<= main_~i~2 2), 24963#(<= main_~i~2 3), 24964#(<= main_~i~2 4), 24965#(<= main_~i~2 5), 24966#(<= main_~i~2 6), 24967#(<= main_~i~2 7), 24968#(<= main_~i~2 8), 24969#(<= main_~i~2 9), 24970#(<= main_~i~2 10), 24971#(<= main_~i~2 11), 24972#(<= main_~i~2 12), 24973#(<= main_~i~2 13), 24974#(<= main_~i~2 14), 24975#(<= main_~i~2 15), 24976#(<= main_~i~2 16), 24977#(<= main_~i~2 17), 24978#(<= main_~i~2 18), 24979#(<= main_~i~2 19), 24980#(<= main_~i~2 20), 24981#(<= main_~i~2 21), 24982#(<= main_~i~2 22), 24983#(<= main_~i~2 23), 24984#(<= main_~i~2 24), 24985#(<= main_~i~2 25), 24986#(<= main_~i~2 26), 24987#(<= main_~i~2 27), 24988#(<= main_~i~2 28), 24989#(<= main_~i~2 29), 24990#(<= main_~i~2 30), 24991#(<= main_~i~2 31), 24992#(<= main_~i~2 32), 24993#(<= main_~i~2 33), 24994#(<= main_~i~2 34), 24995#(<= main_~i~2 35), 24996#(<= main_~i~2 36), 24997#(<= main_~i~2 37), 24998#(<= main_~i~2 38), 24958#true, 24959#false] [2018-04-12 04:47:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 57581 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 52584 trivial. 0 not checked. [2018-04-12 04:47:36,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 04:47:36,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 04:47:36,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 04:47:36,255 INFO L87 Difference]: Start difference. First operand 381 states and 421 transitions. Second operand 41 states. [2018-04-12 04:47:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:36,573 INFO L93 Difference]: Finished difference Result 393 states and 435 transitions. [2018-04-12 04:47:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 04:47:36,573 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1767 [2018-04-12 04:47:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:36,575 INFO L225 Difference]: With dead ends: 393 [2018-04-12 04:47:36,575 INFO L226 Difference]: Without dead ends: 393 [2018-04-12 04:47:36,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 04:47:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-12 04:47:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-04-12 04:47:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-12 04:47:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 429 transitions. [2018-04-12 04:47:36,579 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 429 transitions. Word has length 1767 [2018-04-12 04:47:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:36,580 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 429 transitions. [2018-04-12 04:47:36,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 04:47:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 429 transitions. [2018-04-12 04:47:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1815 [2018-04-12 04:47:36,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:36,593 INFO L355 BasicCegarLoop]: trace histogram [114, 114, 75, 75, 75, 75, 75, 75, 75, 75, 75, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:36,593 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash -635302579, now seen corresponding path program 37 times [2018-04-12 04:47:36,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:36,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 60752 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 55487 trivial. 0 not checked. [2018-04-12 04:47:42,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:42,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 04:47:42,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 26640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26640 trivial. 0 not checked. [2018-04-12 04:47:42,510 INFO L182 omatonBuilderFactory]: Interpolants [25792#(<= main_~i~2 10), 25793#(<= main_~i~2 11), 25794#(<= main_~i~2 12), 25795#(<= main_~i~2 13), 25796#(<= main_~i~2 14), 25797#(<= main_~i~2 15), 25798#(<= main_~i~2 16), 25799#(<= main_~i~2 17), 25800#(<= main_~i~2 18), 25801#(<= main_~i~2 19), 25802#(<= main_~i~2 20), 25803#(<= main_~i~2 21), 25804#(<= main_~i~2 22), 25805#(<= main_~i~2 23), 25806#(<= main_~i~2 24), 25807#(<= main_~i~2 25), 25808#(<= main_~i~2 26), 25809#(<= main_~i~2 27), 25810#(<= main_~i~2 28), 25811#(<= main_~i~2 29), 25812#(<= main_~i~2 30), 25813#(<= main_~i~2 31), 25814#(<= main_~i~2 32), 25815#(<= main_~i~2 33), 25816#(<= main_~i~2 34), 25817#(<= main_~i~2 35), 25818#(<= main_~i~2 36), 25819#(<= main_~i~2 37), 25820#(<= main_~i~2 38), 25821#(<= main_~i~2 39), 25780#true, 25781#false, 25782#(= main_~i~2 0), 25783#(<= main_~i~2 1), 25784#(<= main_~i~2 2), 25785#(<= main_~i~2 3), 25786#(<= main_~i~2 4), 25787#(<= main_~i~2 5), 25788#(<= main_~i~2 6), 25789#(<= main_~i~2 7), 25790#(<= main_~i~2 8), 25791#(<= main_~i~2 9)] [2018-04-12 04:47:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 60752 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 55487 trivial. 0 not checked. [2018-04-12 04:47:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 04:47:42,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 04:47:42,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 04:47:42,511 INFO L87 Difference]: Start difference. First operand 388 states and 429 transitions. Second operand 42 states. [2018-04-12 04:47:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:42,770 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2018-04-12 04:47:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 04:47:42,770 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1814 [2018-04-12 04:47:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:42,772 INFO L225 Difference]: With dead ends: 400 [2018-04-12 04:47:42,772 INFO L226 Difference]: Without dead ends: 400 [2018-04-12 04:47:42,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 04:47:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-04-12 04:47:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 395. [2018-04-12 04:47:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-12 04:47:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 437 transitions. [2018-04-12 04:47:42,776 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 437 transitions. Word has length 1814 [2018-04-12 04:47:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:42,776 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 437 transitions. [2018-04-12 04:47:42,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 04:47:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 437 transitions. [2018-04-12 04:47:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1862 [2018-04-12 04:47:42,790 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:42,790 INFO L355 BasicCegarLoop]: trace histogram [117, 117, 77, 77, 77, 77, 77, 77, 77, 77, 77, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:42,790 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1786419315, now seen corresponding path program 38 times [2018-04-12 04:47:42,791 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:42,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 64008 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 58468 trivial. 0 not checked. [2018-04-12 04:47:49,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:49,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-12 04:47:49,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 28120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28120 trivial. 0 not checked. [2018-04-12 04:47:49,236 INFO L182 omatonBuilderFactory]: Interpolants [26624#(<= main_~i~2 5), 26625#(<= main_~i~2 6), 26626#(<= main_~i~2 7), 26627#(<= main_~i~2 8), 26628#(<= main_~i~2 9), 26629#(<= main_~i~2 10), 26630#(<= main_~i~2 11), 26631#(<= main_~i~2 12), 26632#(<= main_~i~2 13), 26633#(<= main_~i~2 14), 26634#(<= main_~i~2 15), 26635#(<= main_~i~2 16), 26636#(<= main_~i~2 17), 26637#(<= main_~i~2 18), 26638#(<= main_~i~2 19), 26639#(<= main_~i~2 20), 26640#(<= main_~i~2 21), 26641#(<= main_~i~2 22), 26642#(<= main_~i~2 23), 26643#(<= main_~i~2 24), 26644#(<= main_~i~2 25), 26645#(<= main_~i~2 26), 26646#(<= main_~i~2 27), 26647#(<= main_~i~2 28), 26648#(<= main_~i~2 29), 26649#(<= main_~i~2 30), 26650#(<= main_~i~2 31), 26651#(<= main_~i~2 32), 26652#(<= main_~i~2 33), 26653#(<= main_~i~2 34), 26654#(<= main_~i~2 35), 26655#(<= main_~i~2 36), 26656#(<= main_~i~2 37), 26657#(<= main_~i~2 38), 26658#(<= main_~i~2 39), 26659#(<= main_~i~2 40), 26617#true, 26618#false, 26619#(= main_~i~2 0), 26620#(<= main_~i~2 1), 26621#(<= main_~i~2 2), 26622#(<= main_~i~2 3), 26623#(<= main_~i~2 4)] [2018-04-12 04:47:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 64008 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 58468 trivial. 0 not checked. [2018-04-12 04:47:49,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 04:47:49,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 04:47:49,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 04:47:49,238 INFO L87 Difference]: Start difference. First operand 395 states and 437 transitions. Second operand 43 states. [2018-04-12 04:47:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:49,533 INFO L93 Difference]: Finished difference Result 407 states and 451 transitions. [2018-04-12 04:47:49,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 04:47:49,533 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1861 [2018-04-12 04:47:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:49,535 INFO L225 Difference]: With dead ends: 407 [2018-04-12 04:47:49,535 INFO L226 Difference]: Without dead ends: 407 [2018-04-12 04:47:49,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 04:47:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-12 04:47:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 402. [2018-04-12 04:47:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-12 04:47:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 445 transitions. [2018-04-12 04:47:49,539 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 445 transitions. Word has length 1861 [2018-04-12 04:47:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:49,540 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 445 transitions. [2018-04-12 04:47:49,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 04:47:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 445 transitions. [2018-04-12 04:47:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1909 [2018-04-12 04:47:49,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:49,555 INFO L355 BasicCegarLoop]: trace histogram [120, 120, 79, 79, 79, 79, 79, 79, 79, 79, 79, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:49,555 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 421180557, now seen corresponding path program 39 times [2018-04-12 04:47:49,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:49,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:47:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 67349 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 61527 trivial. 0 not checked. [2018-04-12 04:47:56,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:47:56,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-12 04:47:56,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:47:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 29640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29640 trivial. 0 not checked. [2018-04-12 04:47:56,384 INFO L182 omatonBuilderFactory]: Interpolants [27469#true, 27470#false, 27471#(= main_~i~2 0), 27472#(<= main_~i~2 1), 27473#(<= main_~i~2 2), 27474#(<= main_~i~2 3), 27475#(<= main_~i~2 4), 27476#(<= main_~i~2 5), 27477#(<= main_~i~2 6), 27478#(<= main_~i~2 7), 27479#(<= main_~i~2 8), 27480#(<= main_~i~2 9), 27481#(<= main_~i~2 10), 27482#(<= main_~i~2 11), 27483#(<= main_~i~2 12), 27484#(<= main_~i~2 13), 27485#(<= main_~i~2 14), 27486#(<= main_~i~2 15), 27487#(<= main_~i~2 16), 27488#(<= main_~i~2 17), 27489#(<= main_~i~2 18), 27490#(<= main_~i~2 19), 27491#(<= main_~i~2 20), 27492#(<= main_~i~2 21), 27493#(<= main_~i~2 22), 27494#(<= main_~i~2 23), 27495#(<= main_~i~2 24), 27496#(<= main_~i~2 25), 27497#(<= main_~i~2 26), 27498#(<= main_~i~2 27), 27499#(<= main_~i~2 28), 27500#(<= main_~i~2 29), 27501#(<= main_~i~2 30), 27502#(<= main_~i~2 31), 27503#(<= main_~i~2 32), 27504#(<= main_~i~2 33), 27505#(<= main_~i~2 34), 27506#(<= main_~i~2 35), 27507#(<= main_~i~2 36), 27508#(<= main_~i~2 37), 27509#(<= main_~i~2 38), 27510#(<= main_~i~2 39), 27511#(<= main_~i~2 40), 27512#(<= main_~i~2 41)] [2018-04-12 04:47:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 67349 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 61527 trivial. 0 not checked. [2018-04-12 04:47:56,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 04:47:56,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 04:47:56,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 04:47:56,385 INFO L87 Difference]: Start difference. First operand 402 states and 445 transitions. Second operand 44 states. [2018-04-12 04:47:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:47:56,741 INFO L93 Difference]: Finished difference Result 414 states and 459 transitions. [2018-04-12 04:47:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 04:47:56,741 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1908 [2018-04-12 04:47:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:47:56,742 INFO L225 Difference]: With dead ends: 414 [2018-04-12 04:47:56,743 INFO L226 Difference]: Without dead ends: 414 [2018-04-12 04:47:56,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 04:47:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-12 04:47:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 409. [2018-04-12 04:47:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-12 04:47:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 453 transitions. [2018-04-12 04:47:56,746 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 453 transitions. Word has length 1908 [2018-04-12 04:47:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:47:56,747 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 453 transitions. [2018-04-12 04:47:56,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 04:47:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 453 transitions. [2018-04-12 04:47:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-04-12 04:47:56,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:47:56,762 INFO L355 BasicCegarLoop]: trace histogram [123, 123, 81, 81, 81, 81, 81, 81, 81, 81, 81, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:47:56,762 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:47:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -557610701, now seen corresponding path program 40 times [2018-04-12 04:47:56,762 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:47:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:47:56,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:48:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 70775 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 64664 trivial. 0 not checked. [2018-04-12 04:48:04,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:48:04,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-12 04:48:04,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:48:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 31200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31200 trivial. 0 not checked. [2018-04-12 04:48:04,023 INFO L182 omatonBuilderFactory]: Interpolants [28352#(<= main_~i~2 14), 28353#(<= main_~i~2 15), 28354#(<= main_~i~2 16), 28355#(<= main_~i~2 17), 28356#(<= main_~i~2 18), 28357#(<= main_~i~2 19), 28358#(<= main_~i~2 20), 28359#(<= main_~i~2 21), 28360#(<= main_~i~2 22), 28361#(<= main_~i~2 23), 28362#(<= main_~i~2 24), 28363#(<= main_~i~2 25), 28364#(<= main_~i~2 26), 28365#(<= main_~i~2 27), 28366#(<= main_~i~2 28), 28367#(<= main_~i~2 29), 28368#(<= main_~i~2 30), 28369#(<= main_~i~2 31), 28370#(<= main_~i~2 32), 28371#(<= main_~i~2 33), 28372#(<= main_~i~2 34), 28373#(<= main_~i~2 35), 28374#(<= main_~i~2 36), 28375#(<= main_~i~2 37), 28376#(<= main_~i~2 38), 28377#(<= main_~i~2 39), 28378#(<= main_~i~2 40), 28379#(<= main_~i~2 41), 28380#(<= main_~i~2 42), 28336#true, 28337#false, 28338#(= main_~i~2 0), 28339#(<= main_~i~2 1), 28340#(<= main_~i~2 2), 28341#(<= main_~i~2 3), 28342#(<= main_~i~2 4), 28343#(<= main_~i~2 5), 28344#(<= main_~i~2 6), 28345#(<= main_~i~2 7), 28346#(<= main_~i~2 8), 28347#(<= main_~i~2 9), 28348#(<= main_~i~2 10), 28349#(<= main_~i~2 11), 28350#(<= main_~i~2 12), 28351#(<= main_~i~2 13)] [2018-04-12 04:48:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 70775 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 64664 trivial. 0 not checked. [2018-04-12 04:48:04,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-12 04:48:04,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-12 04:48:04,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 04:48:04,024 INFO L87 Difference]: Start difference. First operand 409 states and 453 transitions. Second operand 45 states. [2018-04-12 04:48:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:48:04,284 INFO L93 Difference]: Finished difference Result 421 states and 467 transitions. [2018-04-12 04:48:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-12 04:48:04,284 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1955 [2018-04-12 04:48:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:48:04,287 INFO L225 Difference]: With dead ends: 421 [2018-04-12 04:48:04,287 INFO L226 Difference]: Without dead ends: 421 [2018-04-12 04:48:04,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 04:48:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-12 04:48:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 416. [2018-04-12 04:48:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-04-12 04:48:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 461 transitions. [2018-04-12 04:48:04,291 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 461 transitions. Word has length 1955 [2018-04-12 04:48:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:48:04,292 INFO L459 AbstractCegarLoop]: Abstraction has 416 states and 461 transitions. [2018-04-12 04:48:04,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-12 04:48:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 461 transitions. [2018-04-12 04:48:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2003 [2018-04-12 04:48:04,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:48:04,308 INFO L355 BasicCegarLoop]: trace histogram [126, 126, 83, 83, 83, 83, 83, 83, 83, 83, 83, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:48:04,308 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:48:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash -74634291, now seen corresponding path program 41 times [2018-04-12 04:48:04,309 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:48:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:48:04,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:48:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 74286 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 67879 trivial. 0 not checked. [2018-04-12 04:48:12,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:48:12,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 04:48:12,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:48:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32800 trivial. 0 not checked. [2018-04-12 04:48:12,750 INFO L182 omatonBuilderFactory]: Interpolants [29248#(<= main_~i~2 28), 29249#(<= main_~i~2 29), 29250#(<= main_~i~2 30), 29251#(<= main_~i~2 31), 29252#(<= main_~i~2 32), 29253#(<= main_~i~2 33), 29254#(<= main_~i~2 34), 29255#(<= main_~i~2 35), 29256#(<= main_~i~2 36), 29257#(<= main_~i~2 37), 29258#(<= main_~i~2 38), 29259#(<= main_~i~2 39), 29260#(<= main_~i~2 40), 29261#(<= main_~i~2 41), 29262#(<= main_~i~2 42), 29263#(<= main_~i~2 43), 29218#true, 29219#false, 29220#(= main_~i~2 0), 29221#(<= main_~i~2 1), 29222#(<= main_~i~2 2), 29223#(<= main_~i~2 3), 29224#(<= main_~i~2 4), 29225#(<= main_~i~2 5), 29226#(<= main_~i~2 6), 29227#(<= main_~i~2 7), 29228#(<= main_~i~2 8), 29229#(<= main_~i~2 9), 29230#(<= main_~i~2 10), 29231#(<= main_~i~2 11), 29232#(<= main_~i~2 12), 29233#(<= main_~i~2 13), 29234#(<= main_~i~2 14), 29235#(<= main_~i~2 15), 29236#(<= main_~i~2 16), 29237#(<= main_~i~2 17), 29238#(<= main_~i~2 18), 29239#(<= main_~i~2 19), 29240#(<= main_~i~2 20), 29241#(<= main_~i~2 21), 29242#(<= main_~i~2 22), 29243#(<= main_~i~2 23), 29244#(<= main_~i~2 24), 29245#(<= main_~i~2 25), 29246#(<= main_~i~2 26), 29247#(<= main_~i~2 27)] [2018-04-12 04:48:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 74286 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 67879 trivial. 0 not checked. [2018-04-12 04:48:12,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 04:48:12,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 04:48:12,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 04:48:12,752 INFO L87 Difference]: Start difference. First operand 416 states and 461 transitions. Second operand 46 states. [2018-04-12 04:48:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:48:13,010 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2018-04-12 04:48:13,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 04:48:13,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2002 [2018-04-12 04:48:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:48:13,012 INFO L225 Difference]: With dead ends: 428 [2018-04-12 04:48:13,012 INFO L226 Difference]: Without dead ends: 428 [2018-04-12 04:48:13,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 04:48:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-12 04:48:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2018-04-12 04:48:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-12 04:48:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 469 transitions. [2018-04-12 04:48:13,018 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 469 transitions. Word has length 2002 [2018-04-12 04:48:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:48:13,019 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 469 transitions. [2018-04-12 04:48:13,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 04:48:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 469 transitions. [2018-04-12 04:48:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2050 [2018-04-12 04:48:13,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:48:13,036 INFO L355 BasicCegarLoop]: trace histogram [129, 129, 85, 85, 85, 85, 85, 85, 85, 85, 85, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:48:13,036 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:48:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1979230707, now seen corresponding path program 42 times [2018-04-12 04:48:13,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:48:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:48:13,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:48:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 77882 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 71172 trivial. 0 not checked. [2018-04-12 04:48:21,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:48:21,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-12 04:48:21,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:48:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34440 trivial. 0 not checked. [2018-04-12 04:48:21,160 INFO L182 omatonBuilderFactory]: Interpolants [30144#(<= main_~i~2 27), 30145#(<= main_~i~2 28), 30146#(<= main_~i~2 29), 30147#(<= main_~i~2 30), 30148#(<= main_~i~2 31), 30149#(<= main_~i~2 32), 30150#(<= main_~i~2 33), 30151#(<= main_~i~2 34), 30152#(<= main_~i~2 35), 30153#(<= main_~i~2 36), 30154#(<= main_~i~2 37), 30155#(<= main_~i~2 38), 30156#(<= main_~i~2 39), 30157#(<= main_~i~2 40), 30158#(<= main_~i~2 41), 30159#(<= main_~i~2 42), 30160#(<= main_~i~2 43), 30161#(<= main_~i~2 44), 30115#true, 30116#false, 30117#(= main_~i~2 0), 30118#(<= main_~i~2 1), 30119#(<= main_~i~2 2), 30120#(<= main_~i~2 3), 30121#(<= main_~i~2 4), 30122#(<= main_~i~2 5), 30123#(<= main_~i~2 6), 30124#(<= main_~i~2 7), 30125#(<= main_~i~2 8), 30126#(<= main_~i~2 9), 30127#(<= main_~i~2 10), 30128#(<= main_~i~2 11), 30129#(<= main_~i~2 12), 30130#(<= main_~i~2 13), 30131#(<= main_~i~2 14), 30132#(<= main_~i~2 15), 30133#(<= main_~i~2 16), 30134#(<= main_~i~2 17), 30135#(<= main_~i~2 18), 30136#(<= main_~i~2 19), 30137#(<= main_~i~2 20), 30138#(<= main_~i~2 21), 30139#(<= main_~i~2 22), 30140#(<= main_~i~2 23), 30141#(<= main_~i~2 24), 30142#(<= main_~i~2 25), 30143#(<= main_~i~2 26)] [2018-04-12 04:48:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 77882 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 71172 trivial. 0 not checked. [2018-04-12 04:48:21,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-12 04:48:21,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-12 04:48:21,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 04:48:21,162 INFO L87 Difference]: Start difference. First operand 423 states and 469 transitions. Second operand 47 states. [2018-04-12 04:48:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:48:21,478 INFO L93 Difference]: Finished difference Result 435 states and 483 transitions. [2018-04-12 04:48:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 04:48:21,478 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2049 [2018-04-12 04:48:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:48:21,480 INFO L225 Difference]: With dead ends: 435 [2018-04-12 04:48:21,480 INFO L226 Difference]: Without dead ends: 435 [2018-04-12 04:48:21,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 04:48:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-12 04:48:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 430. [2018-04-12 04:48:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-04-12 04:48:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2018-04-12 04:48:21,485 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 2049 [2018-04-12 04:48:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:48:21,486 INFO L459 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2018-04-12 04:48:21,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-12 04:48:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2018-04-12 04:48:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2097 [2018-04-12 04:48:21,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:48:21,503 INFO L355 BasicCegarLoop]: trace histogram [132, 132, 87, 87, 87, 87, 87, 87, 87, 87, 87, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:48:21,504 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:48:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1276284147, now seen corresponding path program 43 times [2018-04-12 04:48:21,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:48:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:48:21,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:48:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 81563 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 74543 trivial. 0 not checked. [2018-04-12 04:48:30,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:48:30,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 04:48:30,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:48:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 36120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36120 trivial. 0 not checked. [2018-04-12 04:48:30,396 INFO L182 omatonBuilderFactory]: Interpolants [31040#(<= main_~i~2 11), 31041#(<= main_~i~2 12), 31042#(<= main_~i~2 13), 31043#(<= main_~i~2 14), 31044#(<= main_~i~2 15), 31045#(<= main_~i~2 16), 31046#(<= main_~i~2 17), 31047#(<= main_~i~2 18), 31048#(<= main_~i~2 19), 31049#(<= main_~i~2 20), 31050#(<= main_~i~2 21), 31051#(<= main_~i~2 22), 31052#(<= main_~i~2 23), 31053#(<= main_~i~2 24), 31054#(<= main_~i~2 25), 31055#(<= main_~i~2 26), 31056#(<= main_~i~2 27), 31057#(<= main_~i~2 28), 31058#(<= main_~i~2 29), 31059#(<= main_~i~2 30), 31060#(<= main_~i~2 31), 31061#(<= main_~i~2 32), 31062#(<= main_~i~2 33), 31063#(<= main_~i~2 34), 31064#(<= main_~i~2 35), 31065#(<= main_~i~2 36), 31066#(<= main_~i~2 37), 31067#(<= main_~i~2 38), 31068#(<= main_~i~2 39), 31069#(<= main_~i~2 40), 31070#(<= main_~i~2 41), 31071#(<= main_~i~2 42), 31072#(<= main_~i~2 43), 31073#(<= main_~i~2 44), 31074#(<= main_~i~2 45), 31027#true, 31028#false, 31029#(= main_~i~2 0), 31030#(<= main_~i~2 1), 31031#(<= main_~i~2 2), 31032#(<= main_~i~2 3), 31033#(<= main_~i~2 4), 31034#(<= main_~i~2 5), 31035#(<= main_~i~2 6), 31036#(<= main_~i~2 7), 31037#(<= main_~i~2 8), 31038#(<= main_~i~2 9), 31039#(<= main_~i~2 10)] [2018-04-12 04:48:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 81563 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 74543 trivial. 0 not checked. [2018-04-12 04:48:30,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 04:48:30,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 04:48:30,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 04:48:30,398 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand 48 states. [2018-04-12 04:48:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:48:30,732 INFO L93 Difference]: Finished difference Result 442 states and 491 transitions. [2018-04-12 04:48:30,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 04:48:30,732 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2096 [2018-04-12 04:48:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:48:30,734 INFO L225 Difference]: With dead ends: 442 [2018-04-12 04:48:30,734 INFO L226 Difference]: Without dead ends: 442 [2018-04-12 04:48:30,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 04:48:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-12 04:48:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 437. [2018-04-12 04:48:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-12 04:48:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 485 transitions. [2018-04-12 04:48:30,738 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 485 transitions. Word has length 2096 [2018-04-12 04:48:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:48:30,739 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 485 transitions. [2018-04-12 04:48:30,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 04:48:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 485 transitions. [2018-04-12 04:48:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2144 [2018-04-12 04:48:30,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:48:30,756 INFO L355 BasicCegarLoop]: trace histogram [135, 135, 89, 89, 89, 89, 89, 89, 89, 89, 89, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:48:30,756 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:48:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash 388364979, now seen corresponding path program 44 times [2018-04-12 04:48:30,757 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:48:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:48:30,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:48:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 85329 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 77992 trivial. 0 not checked. [2018-04-12 04:48:39,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:48:39,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-12 04:48:39,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:48:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 37840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37840 trivial. 0 not checked. [2018-04-12 04:48:39,986 INFO L182 omatonBuilderFactory]: Interpolants [32000#(<= main_~i~2 44), 32001#(<= main_~i~2 45), 32002#(<= main_~i~2 46), 31954#true, 31955#false, 31956#(= main_~i~2 0), 31957#(<= main_~i~2 1), 31958#(<= main_~i~2 2), 31959#(<= main_~i~2 3), 31960#(<= main_~i~2 4), 31961#(<= main_~i~2 5), 31962#(<= main_~i~2 6), 31963#(<= main_~i~2 7), 31964#(<= main_~i~2 8), 31965#(<= main_~i~2 9), 31966#(<= main_~i~2 10), 31967#(<= main_~i~2 11), 31968#(<= main_~i~2 12), 31969#(<= main_~i~2 13), 31970#(<= main_~i~2 14), 31971#(<= main_~i~2 15), 31972#(<= main_~i~2 16), 31973#(<= main_~i~2 17), 31974#(<= main_~i~2 18), 31975#(<= main_~i~2 19), 31976#(<= main_~i~2 20), 31977#(<= main_~i~2 21), 31978#(<= main_~i~2 22), 31979#(<= main_~i~2 23), 31980#(<= main_~i~2 24), 31981#(<= main_~i~2 25), 31982#(<= main_~i~2 26), 31983#(<= main_~i~2 27), 31984#(<= main_~i~2 28), 31985#(<= main_~i~2 29), 31986#(<= main_~i~2 30), 31987#(<= main_~i~2 31), 31988#(<= main_~i~2 32), 31989#(<= main_~i~2 33), 31990#(<= main_~i~2 34), 31991#(<= main_~i~2 35), 31992#(<= main_~i~2 36), 31993#(<= main_~i~2 37), 31994#(<= main_~i~2 38), 31995#(<= main_~i~2 39), 31996#(<= main_~i~2 40), 31997#(<= main_~i~2 41), 31998#(<= main_~i~2 42), 31999#(<= main_~i~2 43)] [2018-04-12 04:48:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 85329 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 77992 trivial. 0 not checked. [2018-04-12 04:48:39,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-12 04:48:39,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-12 04:48:39,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 04:48:39,987 INFO L87 Difference]: Start difference. First operand 437 states and 485 transitions. Second operand 49 states. [2018-04-12 04:48:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:48:40,366 INFO L93 Difference]: Finished difference Result 449 states and 499 transitions. [2018-04-12 04:48:40,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 04:48:40,366 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2143 [2018-04-12 04:48:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:48:40,368 INFO L225 Difference]: With dead ends: 449 [2018-04-12 04:48:40,368 INFO L226 Difference]: Without dead ends: 449 [2018-04-12 04:48:40,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 04:48:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-12 04:48:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2018-04-12 04:48:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-12 04:48:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 493 transitions. [2018-04-12 04:48:40,372 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 493 transitions. Word has length 2143 [2018-04-12 04:48:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:48:40,373 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 493 transitions. [2018-04-12 04:48:40,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-12 04:48:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 493 transitions. [2018-04-12 04:48:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2191 [2018-04-12 04:48:40,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:48:40,391 INFO L355 BasicCegarLoop]: trace histogram [138, 138, 91, 91, 91, 91, 91, 91, 91, 91, 91, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:48:40,391 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:48:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 296716877, now seen corresponding path program 45 times [2018-04-12 04:48:40,392 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:48:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:48:40,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:48:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 89180 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 81519 trivial. 0 not checked. [2018-04-12 04:48:50,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:48:50,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 04:48:50,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:48:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 39600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39600 trivial. 0 not checked. [2018-04-12 04:48:50,146 INFO L182 omatonBuilderFactory]: Interpolants [32896#true, 32897#false, 32898#(= main_~i~2 0), 32899#(<= main_~i~2 1), 32900#(<= main_~i~2 2), 32901#(<= main_~i~2 3), 32902#(<= main_~i~2 4), 32903#(<= main_~i~2 5), 32904#(<= main_~i~2 6), 32905#(<= main_~i~2 7), 32906#(<= main_~i~2 8), 32907#(<= main_~i~2 9), 32908#(<= main_~i~2 10), 32909#(<= main_~i~2 11), 32910#(<= main_~i~2 12), 32911#(<= main_~i~2 13), 32912#(<= main_~i~2 14), 32913#(<= main_~i~2 15), 32914#(<= main_~i~2 16), 32915#(<= main_~i~2 17), 32916#(<= main_~i~2 18), 32917#(<= main_~i~2 19), 32918#(<= main_~i~2 20), 32919#(<= main_~i~2 21), 32920#(<= main_~i~2 22), 32921#(<= main_~i~2 23), 32922#(<= main_~i~2 24), 32923#(<= main_~i~2 25), 32924#(<= main_~i~2 26), 32925#(<= main_~i~2 27), 32926#(<= main_~i~2 28), 32927#(<= main_~i~2 29), 32928#(<= main_~i~2 30), 32929#(<= main_~i~2 31), 32930#(<= main_~i~2 32), 32931#(<= main_~i~2 33), 32932#(<= main_~i~2 34), 32933#(<= main_~i~2 35), 32934#(<= main_~i~2 36), 32935#(<= main_~i~2 37), 32936#(<= main_~i~2 38), 32937#(<= main_~i~2 39), 32938#(<= main_~i~2 40), 32939#(<= main_~i~2 41), 32940#(<= main_~i~2 42), 32941#(<= main_~i~2 43), 32942#(<= main_~i~2 44), 32943#(<= main_~i~2 45), 32944#(<= main_~i~2 46), 32945#(<= main_~i~2 47)] [2018-04-12 04:48:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 89180 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 81519 trivial. 0 not checked. [2018-04-12 04:48:50,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 04:48:50,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 04:48:50,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 04:48:50,147 INFO L87 Difference]: Start difference. First operand 444 states and 493 transitions. Second operand 50 states. [2018-04-12 04:48:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:48:50,581 INFO L93 Difference]: Finished difference Result 456 states and 507 transitions. [2018-04-12 04:48:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 04:48:50,581 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2190 [2018-04-12 04:48:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:48:50,583 INFO L225 Difference]: With dead ends: 456 [2018-04-12 04:48:50,583 INFO L226 Difference]: Without dead ends: 456 [2018-04-12 04:48:50,583 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 04:48:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-12 04:48:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 451. [2018-04-12 04:48:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-04-12 04:48:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 501 transitions. [2018-04-12 04:48:50,587 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 501 transitions. Word has length 2190 [2018-04-12 04:48:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:48:50,587 INFO L459 AbstractCegarLoop]: Abstraction has 451 states and 501 transitions. [2018-04-12 04:48:50,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 04:48:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 501 transitions. [2018-04-12 04:48:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2238 [2018-04-12 04:48:50,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:48:50,606 INFO L355 BasicCegarLoop]: trace histogram [141, 141, 93, 93, 93, 93, 93, 93, 93, 93, 93, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:48:50,606 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:48:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1817672563, now seen corresponding path program 46 times [2018-04-12 04:48:50,607 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:48:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:48:50,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:49:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 93116 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 85124 trivial. 0 not checked. [2018-04-12 04:49:01,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:49:01,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-12 04:49:01,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:49:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 41400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41400 trivial. 0 not checked. [2018-04-12 04:49:01,083 INFO L182 omatonBuilderFactory]: Interpolants [33853#true, 33854#false, 33855#(= main_~i~2 0), 33856#(<= main_~i~2 1), 33857#(<= main_~i~2 2), 33858#(<= main_~i~2 3), 33859#(<= main_~i~2 4), 33860#(<= main_~i~2 5), 33861#(<= main_~i~2 6), 33862#(<= main_~i~2 7), 33863#(<= main_~i~2 8), 33864#(<= main_~i~2 9), 33865#(<= main_~i~2 10), 33866#(<= main_~i~2 11), 33867#(<= main_~i~2 12), 33868#(<= main_~i~2 13), 33869#(<= main_~i~2 14), 33870#(<= main_~i~2 15), 33871#(<= main_~i~2 16), 33872#(<= main_~i~2 17), 33873#(<= main_~i~2 18), 33874#(<= main_~i~2 19), 33875#(<= main_~i~2 20), 33876#(<= main_~i~2 21), 33877#(<= main_~i~2 22), 33878#(<= main_~i~2 23), 33879#(<= main_~i~2 24), 33880#(<= main_~i~2 25), 33881#(<= main_~i~2 26), 33882#(<= main_~i~2 27), 33883#(<= main_~i~2 28), 33884#(<= main_~i~2 29), 33885#(<= main_~i~2 30), 33886#(<= main_~i~2 31), 33887#(<= main_~i~2 32), 33888#(<= main_~i~2 33), 33889#(<= main_~i~2 34), 33890#(<= main_~i~2 35), 33891#(<= main_~i~2 36), 33892#(<= main_~i~2 37), 33893#(<= main_~i~2 38), 33894#(<= main_~i~2 39), 33895#(<= main_~i~2 40), 33896#(<= main_~i~2 41), 33897#(<= main_~i~2 42), 33898#(<= main_~i~2 43), 33899#(<= main_~i~2 44), 33900#(<= main_~i~2 45), 33901#(<= main_~i~2 46), 33902#(<= main_~i~2 47), 33903#(<= main_~i~2 48)] [2018-04-12 04:49:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 93116 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 85124 trivial. 0 not checked. [2018-04-12 04:49:01,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-12 04:49:01,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-12 04:49:01,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 04:49:01,085 INFO L87 Difference]: Start difference. First operand 451 states and 501 transitions. Second operand 51 states. [2018-04-12 04:49:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:49:01,568 INFO L93 Difference]: Finished difference Result 463 states and 515 transitions. [2018-04-12 04:49:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-12 04:49:01,569 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2237 [2018-04-12 04:49:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:49:01,571 INFO L225 Difference]: With dead ends: 463 [2018-04-12 04:49:01,571 INFO L226 Difference]: Without dead ends: 463 [2018-04-12 04:49:01,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 04:49:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-12 04:49:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2018-04-12 04:49:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-12 04:49:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 509 transitions. [2018-04-12 04:49:01,578 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 509 transitions. Word has length 2237 [2018-04-12 04:49:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:49:01,579 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 509 transitions. [2018-04-12 04:49:01,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-12 04:49:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 509 transitions. [2018-04-12 04:49:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2018-04-12 04:49:01,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:49:01,614 INFO L355 BasicCegarLoop]: trace histogram [144, 144, 95, 95, 95, 95, 95, 95, 95, 95, 95, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:49:01,614 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:49:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1052282483, now seen corresponding path program 47 times [2018-04-12 04:49:01,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:49:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:49:01,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:49:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 97137 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 88807 trivial. 0 not checked. [2018-04-12 04:49:12,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:49:12,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 04:49:12,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:49:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 43240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43240 trivial. 0 not checked. [2018-04-12 04:49:12,772 INFO L182 omatonBuilderFactory]: Interpolants [34825#true, 34826#false, 34827#(= main_~i~2 0), 34828#(<= main_~i~2 1), 34829#(<= main_~i~2 2), 34830#(<= main_~i~2 3), 34831#(<= main_~i~2 4), 34832#(<= main_~i~2 5), 34833#(<= main_~i~2 6), 34834#(<= main_~i~2 7), 34835#(<= main_~i~2 8), 34836#(<= main_~i~2 9), 34837#(<= main_~i~2 10), 34838#(<= main_~i~2 11), 34839#(<= main_~i~2 12), 34840#(<= main_~i~2 13), 34841#(<= main_~i~2 14), 34842#(<= main_~i~2 15), 34843#(<= main_~i~2 16), 34844#(<= main_~i~2 17), 34845#(<= main_~i~2 18), 34846#(<= main_~i~2 19), 34847#(<= main_~i~2 20), 34848#(<= main_~i~2 21), 34849#(<= main_~i~2 22), 34850#(<= main_~i~2 23), 34851#(<= main_~i~2 24), 34852#(<= main_~i~2 25), 34853#(<= main_~i~2 26), 34854#(<= main_~i~2 27), 34855#(<= main_~i~2 28), 34856#(<= main_~i~2 29), 34857#(<= main_~i~2 30), 34858#(<= main_~i~2 31), 34859#(<= main_~i~2 32), 34860#(<= main_~i~2 33), 34861#(<= main_~i~2 34), 34862#(<= main_~i~2 35), 34863#(<= main_~i~2 36), 34864#(<= main_~i~2 37), 34865#(<= main_~i~2 38), 34866#(<= main_~i~2 39), 34867#(<= main_~i~2 40), 34868#(<= main_~i~2 41), 34869#(<= main_~i~2 42), 34870#(<= main_~i~2 43), 34871#(<= main_~i~2 44), 34872#(<= main_~i~2 45), 34873#(<= main_~i~2 46), 34874#(<= main_~i~2 47), 34875#(<= main_~i~2 48), 34876#(<= main_~i~2 49)] [2018-04-12 04:49:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 97137 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 88807 trivial. 0 not checked. [2018-04-12 04:49:12,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 04:49:12,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 04:49:12,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 04:49:12,774 INFO L87 Difference]: Start difference. First operand 458 states and 509 transitions. Second operand 52 states. [2018-04-12 04:49:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:49:13,266 INFO L93 Difference]: Finished difference Result 470 states and 523 transitions. [2018-04-12 04:49:13,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 04:49:13,266 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2284 [2018-04-12 04:49:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:49:13,268 INFO L225 Difference]: With dead ends: 470 [2018-04-12 04:49:13,268 INFO L226 Difference]: Without dead ends: 470 [2018-04-12 04:49:13,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 04:49:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-12 04:49:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 465. [2018-04-12 04:49:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-12 04:49:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 517 transitions. [2018-04-12 04:49:13,272 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 517 transitions. Word has length 2284 [2018-04-12 04:49:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:49:13,272 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 517 transitions. [2018-04-12 04:49:13,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 04:49:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 517 transitions. [2018-04-12 04:49:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-04-12 04:49:13,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:49:13,293 INFO L355 BasicCegarLoop]: trace histogram [147, 147, 97, 97, 97, 97, 97, 97, 97, 97, 97, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:49:13,293 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:49:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1567019981, now seen corresponding path program 48 times [2018-04-12 04:49:13,294 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:49:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:49:13,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:49:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 101243 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 92568 trivial. 0 not checked. [2018-04-12 04:49:25,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:49:25,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-12 04:49:25,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:49:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45120 trivial. 0 not checked. [2018-04-12 04:49:25,054 INFO L182 omatonBuilderFactory]: Interpolants [35840#(<= main_~i~2 26), 35841#(<= main_~i~2 27), 35842#(<= main_~i~2 28), 35843#(<= main_~i~2 29), 35844#(<= main_~i~2 30), 35845#(<= main_~i~2 31), 35846#(<= main_~i~2 32), 35847#(<= main_~i~2 33), 35848#(<= main_~i~2 34), 35849#(<= main_~i~2 35), 35850#(<= main_~i~2 36), 35851#(<= main_~i~2 37), 35852#(<= main_~i~2 38), 35853#(<= main_~i~2 39), 35854#(<= main_~i~2 40), 35855#(<= main_~i~2 41), 35856#(<= main_~i~2 42), 35857#(<= main_~i~2 43), 35858#(<= main_~i~2 44), 35859#(<= main_~i~2 45), 35860#(<= main_~i~2 46), 35861#(<= main_~i~2 47), 35862#(<= main_~i~2 48), 35863#(<= main_~i~2 49), 35864#(<= main_~i~2 50), 35812#true, 35813#false, 35814#(= main_~i~2 0), 35815#(<= main_~i~2 1), 35816#(<= main_~i~2 2), 35817#(<= main_~i~2 3), 35818#(<= main_~i~2 4), 35819#(<= main_~i~2 5), 35820#(<= main_~i~2 6), 35821#(<= main_~i~2 7), 35822#(<= main_~i~2 8), 35823#(<= main_~i~2 9), 35824#(<= main_~i~2 10), 35825#(<= main_~i~2 11), 35826#(<= main_~i~2 12), 35827#(<= main_~i~2 13), 35828#(<= main_~i~2 14), 35829#(<= main_~i~2 15), 35830#(<= main_~i~2 16), 35831#(<= main_~i~2 17), 35832#(<= main_~i~2 18), 35833#(<= main_~i~2 19), 35834#(<= main_~i~2 20), 35835#(<= main_~i~2 21), 35836#(<= main_~i~2 22), 35837#(<= main_~i~2 23), 35838#(<= main_~i~2 24), 35839#(<= main_~i~2 25)] [2018-04-12 04:49:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 101243 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 92568 trivial. 0 not checked. [2018-04-12 04:49:25,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 04:49:25,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 04:49:25,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 04:49:25,056 INFO L87 Difference]: Start difference. First operand 465 states and 517 transitions. Second operand 53 states. [2018-04-12 04:49:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:49:25,389 INFO L93 Difference]: Finished difference Result 477 states and 531 transitions. [2018-04-12 04:49:25,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 04:49:25,389 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 2331 [2018-04-12 04:49:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:49:25,391 INFO L225 Difference]: With dead ends: 477 [2018-04-12 04:49:25,391 INFO L226 Difference]: Without dead ends: 477 [2018-04-12 04:49:25,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 04:49:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-12 04:49:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 472. [2018-04-12 04:49:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-12 04:49:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 525 transitions. [2018-04-12 04:49:25,395 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 525 transitions. Word has length 2331 [2018-04-12 04:49:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:49:25,396 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 525 transitions. [2018-04-12 04:49:25,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 04:49:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 525 transitions. [2018-04-12 04:49:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2379 [2018-04-12 04:49:25,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:49:25,418 INFO L355 BasicCegarLoop]: trace histogram [150, 150, 99, 99, 99, 99, 99, 99, 99, 99, 99, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:49:25,418 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:49:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1943459635, now seen corresponding path program 49 times [2018-04-12 04:49:25,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:49:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:49:25,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:49:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 105434 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 96407 trivial. 0 not checked. [2018-04-12 04:49:37,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:49:37,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 04:49:37,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:49:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 47040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47040 trivial. 0 not checked. [2018-04-12 04:49:37,651 INFO L182 omatonBuilderFactory]: Interpolants [36864#(<= main_~i~2 48), 36865#(<= main_~i~2 49), 36866#(<= main_~i~2 50), 36867#(<= main_~i~2 51), 36814#true, 36815#false, 36816#(= main_~i~2 0), 36817#(<= main_~i~2 1), 36818#(<= main_~i~2 2), 36819#(<= main_~i~2 3), 36820#(<= main_~i~2 4), 36821#(<= main_~i~2 5), 36822#(<= main_~i~2 6), 36823#(<= main_~i~2 7), 36824#(<= main_~i~2 8), 36825#(<= main_~i~2 9), 36826#(<= main_~i~2 10), 36827#(<= main_~i~2 11), 36828#(<= main_~i~2 12), 36829#(<= main_~i~2 13), 36830#(<= main_~i~2 14), 36831#(<= main_~i~2 15), 36832#(<= main_~i~2 16), 36833#(<= main_~i~2 17), 36834#(<= main_~i~2 18), 36835#(<= main_~i~2 19), 36836#(<= main_~i~2 20), 36837#(<= main_~i~2 21), 36838#(<= main_~i~2 22), 36839#(<= main_~i~2 23), 36840#(<= main_~i~2 24), 36841#(<= main_~i~2 25), 36842#(<= main_~i~2 26), 36843#(<= main_~i~2 27), 36844#(<= main_~i~2 28), 36845#(<= main_~i~2 29), 36846#(<= main_~i~2 30), 36847#(<= main_~i~2 31), 36848#(<= main_~i~2 32), 36849#(<= main_~i~2 33), 36850#(<= main_~i~2 34), 36851#(<= main_~i~2 35), 36852#(<= main_~i~2 36), 36853#(<= main_~i~2 37), 36854#(<= main_~i~2 38), 36855#(<= main_~i~2 39), 36856#(<= main_~i~2 40), 36857#(<= main_~i~2 41), 36858#(<= main_~i~2 42), 36859#(<= main_~i~2 43), 36860#(<= main_~i~2 44), 36861#(<= main_~i~2 45), 36862#(<= main_~i~2 46), 36863#(<= main_~i~2 47)] [2018-04-12 04:49:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 105434 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 96407 trivial. 0 not checked. [2018-04-12 04:49:37,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 04:49:37,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 04:49:37,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 04:49:37,653 INFO L87 Difference]: Start difference. First operand 472 states and 525 transitions. Second operand 54 states. [2018-04-12 04:49:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:49:38,113 INFO L93 Difference]: Finished difference Result 484 states and 539 transitions. [2018-04-12 04:49:38,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 04:49:38,113 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2378 [2018-04-12 04:49:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:49:38,115 INFO L225 Difference]: With dead ends: 484 [2018-04-12 04:49:38,115 INFO L226 Difference]: Without dead ends: 484 [2018-04-12 04:49:38,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 04:49:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-12 04:49:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 479. [2018-04-12 04:49:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-04-12 04:49:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 533 transitions. [2018-04-12 04:49:38,120 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 533 transitions. Word has length 2378 [2018-04-12 04:49:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:49:38,120 INFO L459 AbstractCegarLoop]: Abstraction has 479 states and 533 transitions. [2018-04-12 04:49:38,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 04:49:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 533 transitions. [2018-04-12 04:49:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2426 [2018-04-12 04:49:38,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:49:38,142 INFO L355 BasicCegarLoop]: trace histogram [153, 153, 101, 101, 101, 101, 101, 101, 101, 101, 101, 53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:49:38,142 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:49:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 704056563, now seen corresponding path program 50 times [2018-04-12 04:49:38,143 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:49:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:49:38,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:49:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 109710 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 100324 trivial. 0 not checked. [2018-04-12 04:49:51,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:49:51,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-12 04:49:51,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:49:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 49000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49000 trivial. 0 not checked. [2018-04-12 04:49:51,633 INFO L182 omatonBuilderFactory]: Interpolants [37831#true, 37832#false, 37833#(= main_~i~2 0), 37834#(<= main_~i~2 1), 37835#(<= main_~i~2 2), 37836#(<= main_~i~2 3), 37837#(<= main_~i~2 4), 37838#(<= main_~i~2 5), 37839#(<= main_~i~2 6), 37840#(<= main_~i~2 7), 37841#(<= main_~i~2 8), 37842#(<= main_~i~2 9), 37843#(<= main_~i~2 10), 37844#(<= main_~i~2 11), 37845#(<= main_~i~2 12), 37846#(<= main_~i~2 13), 37847#(<= main_~i~2 14), 37848#(<= main_~i~2 15), 37849#(<= main_~i~2 16), 37850#(<= main_~i~2 17), 37851#(<= main_~i~2 18), 37852#(<= main_~i~2 19), 37853#(<= main_~i~2 20), 37854#(<= main_~i~2 21), 37855#(<= main_~i~2 22), 37856#(<= main_~i~2 23), 37857#(<= main_~i~2 24), 37858#(<= main_~i~2 25), 37859#(<= main_~i~2 26), 37860#(<= main_~i~2 27), 37861#(<= main_~i~2 28), 37862#(<= main_~i~2 29), 37863#(<= main_~i~2 30), 37864#(<= main_~i~2 31), 37865#(<= main_~i~2 32), 37866#(<= main_~i~2 33), 37867#(<= main_~i~2 34), 37868#(<= main_~i~2 35), 37869#(<= main_~i~2 36), 37870#(<= main_~i~2 37), 37871#(<= main_~i~2 38), 37872#(<= main_~i~2 39), 37873#(<= main_~i~2 40), 37874#(<= main_~i~2 41), 37875#(<= main_~i~2 42), 37876#(<= main_~i~2 43), 37877#(<= main_~i~2 44), 37878#(<= main_~i~2 45), 37879#(<= main_~i~2 46), 37880#(<= main_~i~2 47), 37881#(<= main_~i~2 48), 37882#(<= main_~i~2 49), 37883#(<= main_~i~2 50), 37884#(<= main_~i~2 51), 37885#(<= main_~i~2 52)] [2018-04-12 04:49:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 109710 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 100324 trivial. 0 not checked. [2018-04-12 04:49:51,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 04:49:51,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 04:49:51,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 04:49:51,635 INFO L87 Difference]: Start difference. First operand 479 states and 533 transitions. Second operand 55 states. [2018-04-12 04:49:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:49:52,156 INFO L93 Difference]: Finished difference Result 491 states and 547 transitions. [2018-04-12 04:49:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 04:49:52,156 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 2425 [2018-04-12 04:49:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:49:52,158 INFO L225 Difference]: With dead ends: 491 [2018-04-12 04:49:52,159 INFO L226 Difference]: Without dead ends: 491 [2018-04-12 04:49:52,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 04:49:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-12 04:49:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 486. [2018-04-12 04:49:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-04-12 04:49:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 541 transitions. [2018-04-12 04:49:52,163 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 541 transitions. Word has length 2425 [2018-04-12 04:49:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:49:52,163 INFO L459 AbstractCegarLoop]: Abstraction has 486 states and 541 transitions. [2018-04-12 04:49:52,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 04:49:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 541 transitions. [2018-04-12 04:49:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2473 [2018-04-12 04:49:52,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:49:52,186 INFO L355 BasicCegarLoop]: trace histogram [156, 156, 103, 103, 103, 103, 103, 103, 103, 103, 103, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:49:52,186 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:49:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1731678195, now seen corresponding path program 51 times [2018-04-12 04:49:52,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:49:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:49:52,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:50:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 114071 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 104319 trivial. 0 not checked. [2018-04-12 04:50:05,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:50:05,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 04:50:05,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:50:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 51000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51000 trivial. 0 not checked. [2018-04-12 04:50:05,943 INFO L182 omatonBuilderFactory]: Interpolants [38912#(<= main_~i~2 47), 38913#(<= main_~i~2 48), 38914#(<= main_~i~2 49), 38915#(<= main_~i~2 50), 38916#(<= main_~i~2 51), 38917#(<= main_~i~2 52), 38918#(<= main_~i~2 53), 38863#true, 38864#false, 38865#(= main_~i~2 0), 38866#(<= main_~i~2 1), 38867#(<= main_~i~2 2), 38868#(<= main_~i~2 3), 38869#(<= main_~i~2 4), 38870#(<= main_~i~2 5), 38871#(<= main_~i~2 6), 38872#(<= main_~i~2 7), 38873#(<= main_~i~2 8), 38874#(<= main_~i~2 9), 38875#(<= main_~i~2 10), 38876#(<= main_~i~2 11), 38877#(<= main_~i~2 12), 38878#(<= main_~i~2 13), 38879#(<= main_~i~2 14), 38880#(<= main_~i~2 15), 38881#(<= main_~i~2 16), 38882#(<= main_~i~2 17), 38883#(<= main_~i~2 18), 38884#(<= main_~i~2 19), 38885#(<= main_~i~2 20), 38886#(<= main_~i~2 21), 38887#(<= main_~i~2 22), 38888#(<= main_~i~2 23), 38889#(<= main_~i~2 24), 38890#(<= main_~i~2 25), 38891#(<= main_~i~2 26), 38892#(<= main_~i~2 27), 38893#(<= main_~i~2 28), 38894#(<= main_~i~2 29), 38895#(<= main_~i~2 30), 38896#(<= main_~i~2 31), 38897#(<= main_~i~2 32), 38898#(<= main_~i~2 33), 38899#(<= main_~i~2 34), 38900#(<= main_~i~2 35), 38901#(<= main_~i~2 36), 38902#(<= main_~i~2 37), 38903#(<= main_~i~2 38), 38904#(<= main_~i~2 39), 38905#(<= main_~i~2 40), 38906#(<= main_~i~2 41), 38907#(<= main_~i~2 42), 38908#(<= main_~i~2 43), 38909#(<= main_~i~2 44), 38910#(<= main_~i~2 45), 38911#(<= main_~i~2 46)] [2018-04-12 04:50:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 114071 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 104319 trivial. 0 not checked. [2018-04-12 04:50:05,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 04:50:05,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 04:50:05,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 04:50:05,945 INFO L87 Difference]: Start difference. First operand 486 states and 541 transitions. Second operand 56 states. [2018-04-12 04:50:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:50:06,414 INFO L93 Difference]: Finished difference Result 498 states and 555 transitions. [2018-04-12 04:50:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 04:50:06,415 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2472 [2018-04-12 04:50:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:50:06,416 INFO L225 Difference]: With dead ends: 498 [2018-04-12 04:50:06,416 INFO L226 Difference]: Without dead ends: 498 [2018-04-12 04:50:06,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 04:50:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-04-12 04:50:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 493. [2018-04-12 04:50:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-12 04:50:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 549 transitions. [2018-04-12 04:50:06,421 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 549 transitions. Word has length 2472 [2018-04-12 04:50:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:50:06,423 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 549 transitions. [2018-04-12 04:50:06,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 04:50:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 549 transitions. [2018-04-12 04:50:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2520 [2018-04-12 04:50:06,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:50:06,447 INFO L355 BasicCegarLoop]: trace histogram [159, 159, 105, 105, 105, 105, 105, 105, 105, 105, 105, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:50:06,447 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:50:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1971133875, now seen corresponding path program 52 times [2018-04-12 04:50:06,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:50:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:50:06,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:50:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 118517 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 108392 trivial. 0 not checked. [2018-04-12 04:50:20,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:50:20,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-12 04:50:20,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:50:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 53040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53040 trivial. 0 not checked. [2018-04-12 04:50:20,838 INFO L182 omatonBuilderFactory]: Interpolants [39936#(<= main_~i~2 24), 39937#(<= main_~i~2 25), 39938#(<= main_~i~2 26), 39939#(<= main_~i~2 27), 39940#(<= main_~i~2 28), 39941#(<= main_~i~2 29), 39942#(<= main_~i~2 30), 39943#(<= main_~i~2 31), 39944#(<= main_~i~2 32), 39945#(<= main_~i~2 33), 39946#(<= main_~i~2 34), 39947#(<= main_~i~2 35), 39948#(<= main_~i~2 36), 39949#(<= main_~i~2 37), 39950#(<= main_~i~2 38), 39951#(<= main_~i~2 39), 39952#(<= main_~i~2 40), 39953#(<= main_~i~2 41), 39954#(<= main_~i~2 42), 39955#(<= main_~i~2 43), 39956#(<= main_~i~2 44), 39957#(<= main_~i~2 45), 39958#(<= main_~i~2 46), 39959#(<= main_~i~2 47), 39960#(<= main_~i~2 48), 39961#(<= main_~i~2 49), 39962#(<= main_~i~2 50), 39963#(<= main_~i~2 51), 39964#(<= main_~i~2 52), 39965#(<= main_~i~2 53), 39966#(<= main_~i~2 54), 39910#true, 39911#false, 39912#(= main_~i~2 0), 39913#(<= main_~i~2 1), 39914#(<= main_~i~2 2), 39915#(<= main_~i~2 3), 39916#(<= main_~i~2 4), 39917#(<= main_~i~2 5), 39918#(<= main_~i~2 6), 39919#(<= main_~i~2 7), 39920#(<= main_~i~2 8), 39921#(<= main_~i~2 9), 39922#(<= main_~i~2 10), 39923#(<= main_~i~2 11), 39924#(<= main_~i~2 12), 39925#(<= main_~i~2 13), 39926#(<= main_~i~2 14), 39927#(<= main_~i~2 15), 39928#(<= main_~i~2 16), 39929#(<= main_~i~2 17), 39930#(<= main_~i~2 18), 39931#(<= main_~i~2 19), 39932#(<= main_~i~2 20), 39933#(<= main_~i~2 21), 39934#(<= main_~i~2 22), 39935#(<= main_~i~2 23)] [2018-04-12 04:50:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 118517 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 108392 trivial. 0 not checked. [2018-04-12 04:50:20,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-12 04:50:20,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-12 04:50:20,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 04:50:20,840 INFO L87 Difference]: Start difference. First operand 493 states and 549 transitions. Second operand 57 states. [2018-04-12 04:50:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:50:21,225 INFO L93 Difference]: Finished difference Result 505 states and 563 transitions. [2018-04-12 04:50:21,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-12 04:50:21,225 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 2519 [2018-04-12 04:50:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:50:21,227 INFO L225 Difference]: With dead ends: 505 [2018-04-12 04:50:21,227 INFO L226 Difference]: Without dead ends: 505 [2018-04-12 04:50:21,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 04:50:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-04-12 04:50:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 500. [2018-04-12 04:50:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-04-12 04:50:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 557 transitions. [2018-04-12 04:50:21,231 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 557 transitions. Word has length 2519 [2018-04-12 04:50:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:50:21,232 INFO L459 AbstractCegarLoop]: Abstraction has 500 states and 557 transitions. [2018-04-12 04:50:21,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-12 04:50:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 557 transitions. [2018-04-12 04:50:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2567 [2018-04-12 04:50:21,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:50:21,256 INFO L355 BasicCegarLoop]: trace histogram [162, 162, 107, 107, 107, 107, 107, 107, 107, 107, 107, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:50:21,256 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:50:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1432746163, now seen corresponding path program 53 times [2018-04-12 04:50:21,257 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:50:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:50:21,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:50:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 123048 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 112543 trivial. 0 not checked. [2018-04-12 04:50:36,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:50:36,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 04:50:36,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:50:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 55120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55120 trivial. 0 not checked. [2018-04-12 04:50:36,377 INFO L182 omatonBuilderFactory]: Interpolants [40972#true, 40973#false, 40974#(= main_~i~2 0), 40975#(<= main_~i~2 1), 40976#(<= main_~i~2 2), 40977#(<= main_~i~2 3), 40978#(<= main_~i~2 4), 40979#(<= main_~i~2 5), 40980#(<= main_~i~2 6), 40981#(<= main_~i~2 7), 40982#(<= main_~i~2 8), 40983#(<= main_~i~2 9), 40984#(<= main_~i~2 10), 40985#(<= main_~i~2 11), 40986#(<= main_~i~2 12), 40987#(<= main_~i~2 13), 40988#(<= main_~i~2 14), 40989#(<= main_~i~2 15), 40990#(<= main_~i~2 16), 40991#(<= main_~i~2 17), 40992#(<= main_~i~2 18), 40993#(<= main_~i~2 19), 40994#(<= main_~i~2 20), 40995#(<= main_~i~2 21), 40996#(<= main_~i~2 22), 40997#(<= main_~i~2 23), 40998#(<= main_~i~2 24), 40999#(<= main_~i~2 25), 41000#(<= main_~i~2 26), 41001#(<= main_~i~2 27), 41002#(<= main_~i~2 28), 41003#(<= main_~i~2 29), 41004#(<= main_~i~2 30), 41005#(<= main_~i~2 31), 41006#(<= main_~i~2 32), 41007#(<= main_~i~2 33), 41008#(<= main_~i~2 34), 41009#(<= main_~i~2 35), 41010#(<= main_~i~2 36), 41011#(<= main_~i~2 37), 41012#(<= main_~i~2 38), 41013#(<= main_~i~2 39), 41014#(<= main_~i~2 40), 41015#(<= main_~i~2 41), 41016#(<= main_~i~2 42), 41017#(<= main_~i~2 43), 41018#(<= main_~i~2 44), 41019#(<= main_~i~2 45), 41020#(<= main_~i~2 46), 41021#(<= main_~i~2 47), 41022#(<= main_~i~2 48), 41023#(<= main_~i~2 49), 41024#(<= main_~i~2 50), 41025#(<= main_~i~2 51), 41026#(<= main_~i~2 52), 41027#(<= main_~i~2 53), 41028#(<= main_~i~2 54), 41029#(<= main_~i~2 55)] [2018-04-12 04:50:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 123048 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 112543 trivial. 0 not checked. [2018-04-12 04:50:36,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 04:50:36,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 04:50:36,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 04:50:36,379 INFO L87 Difference]: Start difference. First operand 500 states and 557 transitions. Second operand 58 states. [2018-04-12 04:50:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:50:36,978 INFO L93 Difference]: Finished difference Result 512 states and 571 transitions. [2018-04-12 04:50:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-12 04:50:36,978 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2566 [2018-04-12 04:50:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:50:36,981 INFO L225 Difference]: With dead ends: 512 [2018-04-12 04:50:36,981 INFO L226 Difference]: Without dead ends: 512 [2018-04-12 04:50:36,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 04:50:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-04-12 04:50:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 507. [2018-04-12 04:50:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-04-12 04:50:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 565 transitions. [2018-04-12 04:50:36,988 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 565 transitions. Word has length 2566 [2018-04-12 04:50:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:50:36,989 INFO L459 AbstractCegarLoop]: Abstraction has 507 states and 565 transitions. [2018-04-12 04:50:36,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 04:50:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 565 transitions. [2018-04-12 04:50:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2614 [2018-04-12 04:50:37,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:50:37,019 INFO L355 BasicCegarLoop]: trace histogram [165, 165, 109, 109, 109, 109, 109, 109, 109, 109, 109, 57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:50:37,019 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:50:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1153999245, now seen corresponding path program 54 times [2018-04-12 04:50:37,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:50:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:50:37,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:50:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 127664 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 116772 trivial. 0 not checked. [2018-04-12 04:50:52,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:50:52,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-12 04:50:52,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:50:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 57240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57240 trivial. 0 not checked. [2018-04-12 04:50:52,871 INFO L182 omatonBuilderFactory]: Interpolants [42049#true, 42050#false, 42051#(= main_~i~2 0), 42052#(<= main_~i~2 1), 42053#(<= main_~i~2 2), 42054#(<= main_~i~2 3), 42055#(<= main_~i~2 4), 42056#(<= main_~i~2 5), 42057#(<= main_~i~2 6), 42058#(<= main_~i~2 7), 42059#(<= main_~i~2 8), 42060#(<= main_~i~2 9), 42061#(<= main_~i~2 10), 42062#(<= main_~i~2 11), 42063#(<= main_~i~2 12), 42064#(<= main_~i~2 13), 42065#(<= main_~i~2 14), 42066#(<= main_~i~2 15), 42067#(<= main_~i~2 16), 42068#(<= main_~i~2 17), 42069#(<= main_~i~2 18), 42070#(<= main_~i~2 19), 42071#(<= main_~i~2 20), 42072#(<= main_~i~2 21), 42073#(<= main_~i~2 22), 42074#(<= main_~i~2 23), 42075#(<= main_~i~2 24), 42076#(<= main_~i~2 25), 42077#(<= main_~i~2 26), 42078#(<= main_~i~2 27), 42079#(<= main_~i~2 28), 42080#(<= main_~i~2 29), 42081#(<= main_~i~2 30), 42082#(<= main_~i~2 31), 42083#(<= main_~i~2 32), 42084#(<= main_~i~2 33), 42085#(<= main_~i~2 34), 42086#(<= main_~i~2 35), 42087#(<= main_~i~2 36), 42088#(<= main_~i~2 37), 42089#(<= main_~i~2 38), 42090#(<= main_~i~2 39), 42091#(<= main_~i~2 40), 42092#(<= main_~i~2 41), 42093#(<= main_~i~2 42), 42094#(<= main_~i~2 43), 42095#(<= main_~i~2 44), 42096#(<= main_~i~2 45), 42097#(<= main_~i~2 46), 42098#(<= main_~i~2 47), 42099#(<= main_~i~2 48), 42100#(<= main_~i~2 49), 42101#(<= main_~i~2 50), 42102#(<= main_~i~2 51), 42103#(<= main_~i~2 52), 42104#(<= main_~i~2 53), 42105#(<= main_~i~2 54), 42106#(<= main_~i~2 55), 42107#(<= main_~i~2 56)] [2018-04-12 04:50:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 127664 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 116772 trivial. 0 not checked. [2018-04-12 04:50:52,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-12 04:50:52,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-12 04:50:52,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 04:50:52,873 INFO L87 Difference]: Start difference. First operand 507 states and 565 transitions. Second operand 59 states. [2018-04-12 04:50:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:50:53,526 INFO L93 Difference]: Finished difference Result 519 states and 579 transitions. [2018-04-12 04:50:53,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-12 04:50:53,526 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 2613 [2018-04-12 04:50:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:50:53,528 INFO L225 Difference]: With dead ends: 519 [2018-04-12 04:50:53,528 INFO L226 Difference]: Without dead ends: 519 [2018-04-12 04:50:53,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 04:50:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-12 04:50:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2018-04-12 04:50:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-04-12 04:50:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 573 transitions. [2018-04-12 04:50:53,532 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 573 transitions. Word has length 2613 [2018-04-12 04:50:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:50:53,533 INFO L459 AbstractCegarLoop]: Abstraction has 514 states and 573 transitions. [2018-04-12 04:50:53,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-12 04:50:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 573 transitions. [2018-04-12 04:50:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2661 [2018-04-12 04:50:53,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:50:53,559 INFO L355 BasicCegarLoop]: trace histogram [168, 168, 111, 111, 111, 111, 111, 111, 111, 111, 111, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:50:53,559 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:50:53,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1645293197, now seen corresponding path program 55 times [2018-04-12 04:50:53,560 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:50:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:50:53,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:51:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 132365 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 121079 trivial. 0 not checked. [2018-04-12 04:51:10,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:51:10,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 04:51:10,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:51:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 59400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59400 trivial. 0 not checked. [2018-04-12 04:51:10,288 INFO L182 omatonBuilderFactory]: Interpolants [43141#true, 43142#false, 43143#(= main_~i~2 0), 43144#(<= main_~i~2 1), 43145#(<= main_~i~2 2), 43146#(<= main_~i~2 3), 43147#(<= main_~i~2 4), 43148#(<= main_~i~2 5), 43149#(<= main_~i~2 6), 43150#(<= main_~i~2 7), 43151#(<= main_~i~2 8), 43152#(<= main_~i~2 9), 43153#(<= main_~i~2 10), 43154#(<= main_~i~2 11), 43155#(<= main_~i~2 12), 43156#(<= main_~i~2 13), 43157#(<= main_~i~2 14), 43158#(<= main_~i~2 15), 43159#(<= main_~i~2 16), 43160#(<= main_~i~2 17), 43161#(<= main_~i~2 18), 43162#(<= main_~i~2 19), 43163#(<= main_~i~2 20), 43164#(<= main_~i~2 21), 43165#(<= main_~i~2 22), 43166#(<= main_~i~2 23), 43167#(<= main_~i~2 24), 43168#(<= main_~i~2 25), 43169#(<= main_~i~2 26), 43170#(<= main_~i~2 27), 43171#(<= main_~i~2 28), 43172#(<= main_~i~2 29), 43173#(<= main_~i~2 30), 43174#(<= main_~i~2 31), 43175#(<= main_~i~2 32), 43176#(<= main_~i~2 33), 43177#(<= main_~i~2 34), 43178#(<= main_~i~2 35), 43179#(<= main_~i~2 36), 43180#(<= main_~i~2 37), 43181#(<= main_~i~2 38), 43182#(<= main_~i~2 39), 43183#(<= main_~i~2 40), 43184#(<= main_~i~2 41), 43185#(<= main_~i~2 42), 43186#(<= main_~i~2 43), 43187#(<= main_~i~2 44), 43188#(<= main_~i~2 45), 43189#(<= main_~i~2 46), 43190#(<= main_~i~2 47), 43191#(<= main_~i~2 48), 43192#(<= main_~i~2 49), 43193#(<= main_~i~2 50), 43194#(<= main_~i~2 51), 43195#(<= main_~i~2 52), 43196#(<= main_~i~2 53), 43197#(<= main_~i~2 54), 43198#(<= main_~i~2 55), 43199#(<= main_~i~2 56), 43200#(<= main_~i~2 57)] [2018-04-12 04:51:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 132365 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 121079 trivial. 0 not checked. [2018-04-12 04:51:10,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 04:51:10,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 04:51:10,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 04:51:10,291 INFO L87 Difference]: Start difference. First operand 514 states and 573 transitions. Second operand 60 states. [2018-04-12 04:51:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:51:10,938 INFO L93 Difference]: Finished difference Result 526 states and 587 transitions. [2018-04-12 04:51:10,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-12 04:51:10,939 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2660 [2018-04-12 04:51:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:51:10,940 INFO L225 Difference]: With dead ends: 526 [2018-04-12 04:51:10,940 INFO L226 Difference]: Without dead ends: 526 [2018-04-12 04:51:10,941 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 04:51:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-04-12 04:51:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 521. [2018-04-12 04:51:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-12 04:51:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 581 transitions. [2018-04-12 04:51:10,944 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 581 transitions. Word has length 2660 [2018-04-12 04:51:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:51:10,945 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 581 transitions. [2018-04-12 04:51:10,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 04:51:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 581 transitions. [2018-04-12 04:51:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2708 [2018-04-12 04:51:10,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:51:10,971 INFO L355 BasicCegarLoop]: trace histogram [171, 171, 113, 113, 113, 113, 113, 113, 113, 113, 113, 59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:51:10,971 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:51:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1271804109, now seen corresponding path program 56 times [2018-04-12 04:51:10,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:51:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:51:11,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:51:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 137151 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 125464 trivial. 0 not checked. [2018-04-12 04:51:28,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:51:28,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-12 04:51:28,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:51:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 61600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61600 trivial. 0 not checked. [2018-04-12 04:51:28,562 INFO L182 omatonBuilderFactory]: Interpolants [44288#(<= main_~i~2 38), 44289#(<= main_~i~2 39), 44290#(<= main_~i~2 40), 44291#(<= main_~i~2 41), 44292#(<= main_~i~2 42), 44293#(<= main_~i~2 43), 44294#(<= main_~i~2 44), 44295#(<= main_~i~2 45), 44296#(<= main_~i~2 46), 44297#(<= main_~i~2 47), 44298#(<= main_~i~2 48), 44299#(<= main_~i~2 49), 44300#(<= main_~i~2 50), 44301#(<= main_~i~2 51), 44302#(<= main_~i~2 52), 44303#(<= main_~i~2 53), 44304#(<= main_~i~2 54), 44305#(<= main_~i~2 55), 44306#(<= main_~i~2 56), 44307#(<= main_~i~2 57), 44308#(<= main_~i~2 58), 44248#true, 44249#false, 44250#(= main_~i~2 0), 44251#(<= main_~i~2 1), 44252#(<= main_~i~2 2), 44253#(<= main_~i~2 3), 44254#(<= main_~i~2 4), 44255#(<= main_~i~2 5), 44256#(<= main_~i~2 6), 44257#(<= main_~i~2 7), 44258#(<= main_~i~2 8), 44259#(<= main_~i~2 9), 44260#(<= main_~i~2 10), 44261#(<= main_~i~2 11), 44262#(<= main_~i~2 12), 44263#(<= main_~i~2 13), 44264#(<= main_~i~2 14), 44265#(<= main_~i~2 15), 44266#(<= main_~i~2 16), 44267#(<= main_~i~2 17), 44268#(<= main_~i~2 18), 44269#(<= main_~i~2 19), 44270#(<= main_~i~2 20), 44271#(<= main_~i~2 21), 44272#(<= main_~i~2 22), 44273#(<= main_~i~2 23), 44274#(<= main_~i~2 24), 44275#(<= main_~i~2 25), 44276#(<= main_~i~2 26), 44277#(<= main_~i~2 27), 44278#(<= main_~i~2 28), 44279#(<= main_~i~2 29), 44280#(<= main_~i~2 30), 44281#(<= main_~i~2 31), 44282#(<= main_~i~2 32), 44283#(<= main_~i~2 33), 44284#(<= main_~i~2 34), 44285#(<= main_~i~2 35), 44286#(<= main_~i~2 36), 44287#(<= main_~i~2 37)] [2018-04-12 04:51:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 137151 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 125464 trivial. 0 not checked. [2018-04-12 04:51:28,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-12 04:51:28,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-12 04:51:28,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 04:51:28,564 INFO L87 Difference]: Start difference. First operand 521 states and 581 transitions. Second operand 61 states. [2018-04-12 04:51:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:51:28,975 INFO L93 Difference]: Finished difference Result 533 states and 595 transitions. [2018-04-12 04:51:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 04:51:28,999 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 2707 [2018-04-12 04:51:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:51:29,000 INFO L225 Difference]: With dead ends: 533 [2018-04-12 04:51:29,001 INFO L226 Difference]: Without dead ends: 533 [2018-04-12 04:51:29,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 04:51:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-12 04:51:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 528. [2018-04-12 04:51:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-12 04:51:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 589 transitions. [2018-04-12 04:51:29,005 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 589 transitions. Word has length 2707 [2018-04-12 04:51:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:51:29,005 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 589 transitions. [2018-04-12 04:51:29,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-12 04:51:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 589 transitions. [2018-04-12 04:51:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2755 [2018-04-12 04:51:29,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:51:29,034 INFO L355 BasicCegarLoop]: trace histogram [174, 174, 115, 115, 115, 115, 115, 115, 115, 115, 115, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:51:29,034 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:51:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2091001293, now seen corresponding path program 57 times [2018-04-12 04:51:29,034 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:51:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:51:29,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:51:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 142022 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 129927 trivial. 0 not checked. [2018-04-12 04:51:47,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:51:47,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-12 04:51:47,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:51:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 63840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63840 trivial. 0 not checked. [2018-04-12 04:51:47,406 INFO L182 omatonBuilderFactory]: Interpolants [45370#true, 45371#false, 45372#(= main_~i~2 0), 45373#(<= main_~i~2 1), 45374#(<= main_~i~2 2), 45375#(<= main_~i~2 3), 45376#(<= main_~i~2 4), 45377#(<= main_~i~2 5), 45378#(<= main_~i~2 6), 45379#(<= main_~i~2 7), 45380#(<= main_~i~2 8), 45381#(<= main_~i~2 9), 45382#(<= main_~i~2 10), 45383#(<= main_~i~2 11), 45384#(<= main_~i~2 12), 45385#(<= main_~i~2 13), 45386#(<= main_~i~2 14), 45387#(<= main_~i~2 15), 45388#(<= main_~i~2 16), 45389#(<= main_~i~2 17), 45390#(<= main_~i~2 18), 45391#(<= main_~i~2 19), 45392#(<= main_~i~2 20), 45393#(<= main_~i~2 21), 45394#(<= main_~i~2 22), 45395#(<= main_~i~2 23), 45396#(<= main_~i~2 24), 45397#(<= main_~i~2 25), 45398#(<= main_~i~2 26), 45399#(<= main_~i~2 27), 45400#(<= main_~i~2 28), 45401#(<= main_~i~2 29), 45402#(<= main_~i~2 30), 45403#(<= main_~i~2 31), 45404#(<= main_~i~2 32), 45405#(<= main_~i~2 33), 45406#(<= main_~i~2 34), 45407#(<= main_~i~2 35), 45408#(<= main_~i~2 36), 45409#(<= main_~i~2 37), 45410#(<= main_~i~2 38), 45411#(<= main_~i~2 39), 45412#(<= main_~i~2 40), 45413#(<= main_~i~2 41), 45414#(<= main_~i~2 42), 45415#(<= main_~i~2 43), 45416#(<= main_~i~2 44), 45417#(<= main_~i~2 45), 45418#(<= main_~i~2 46), 45419#(<= main_~i~2 47), 45420#(<= main_~i~2 48), 45421#(<= main_~i~2 49), 45422#(<= main_~i~2 50), 45423#(<= main_~i~2 51), 45424#(<= main_~i~2 52), 45425#(<= main_~i~2 53), 45426#(<= main_~i~2 54), 45427#(<= main_~i~2 55), 45428#(<= main_~i~2 56), 45429#(<= main_~i~2 57), 45430#(<= main_~i~2 58), 45431#(<= main_~i~2 59)] [2018-04-12 04:51:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 142022 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 129927 trivial. 0 not checked. [2018-04-12 04:51:47,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 04:51:47,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 04:51:47,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 04:51:47,408 INFO L87 Difference]: Start difference. First operand 528 states and 589 transitions. Second operand 62 states. [2018-04-12 04:51:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:51:48,148 INFO L93 Difference]: Finished difference Result 540 states and 603 transitions. [2018-04-12 04:51:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-12 04:51:48,148 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2754 [2018-04-12 04:51:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:51:48,150 INFO L225 Difference]: With dead ends: 540 [2018-04-12 04:51:48,150 INFO L226 Difference]: Without dead ends: 540 [2018-04-12 04:51:48,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 04:51:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-12 04:51:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2018-04-12 04:51:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-04-12 04:51:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 597 transitions. [2018-04-12 04:51:48,154 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 597 transitions. Word has length 2754 [2018-04-12 04:51:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:51:48,155 INFO L459 AbstractCegarLoop]: Abstraction has 535 states and 597 transitions. [2018-04-12 04:51:48,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-12 04:51:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 597 transitions. [2018-04-12 04:51:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2802 [2018-04-12 04:51:48,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:51:48,191 INFO L355 BasicCegarLoop]: trace histogram [177, 177, 117, 117, 117, 117, 117, 117, 117, 117, 117, 61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:51:48,191 INFO L408 AbstractCegarLoop]: === Iteration 81 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:51:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1551396851, now seen corresponding path program 58 times [2018-04-12 04:51:48,192 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:51:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:51:48,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:52:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 146978 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 134468 trivial. 0 not checked. [2018-04-12 04:52:08,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:52:08,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-12 04:52:08,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:52:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 66120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66120 trivial. 0 not checked. [2018-04-12 04:52:08,269 INFO L182 omatonBuilderFactory]: Interpolants [46507#true, 46508#false, 46509#(= main_~i~2 0), 46510#(<= main_~i~2 1), 46511#(<= main_~i~2 2), 46512#(<= main_~i~2 3), 46513#(<= main_~i~2 4), 46514#(<= main_~i~2 5), 46515#(<= main_~i~2 6), 46516#(<= main_~i~2 7), 46517#(<= main_~i~2 8), 46518#(<= main_~i~2 9), 46519#(<= main_~i~2 10), 46520#(<= main_~i~2 11), 46521#(<= main_~i~2 12), 46522#(<= main_~i~2 13), 46523#(<= main_~i~2 14), 46524#(<= main_~i~2 15), 46525#(<= main_~i~2 16), 46526#(<= main_~i~2 17), 46527#(<= main_~i~2 18), 46528#(<= main_~i~2 19), 46529#(<= main_~i~2 20), 46530#(<= main_~i~2 21), 46531#(<= main_~i~2 22), 46532#(<= main_~i~2 23), 46533#(<= main_~i~2 24), 46534#(<= main_~i~2 25), 46535#(<= main_~i~2 26), 46536#(<= main_~i~2 27), 46537#(<= main_~i~2 28), 46538#(<= main_~i~2 29), 46539#(<= main_~i~2 30), 46540#(<= main_~i~2 31), 46541#(<= main_~i~2 32), 46542#(<= main_~i~2 33), 46543#(<= main_~i~2 34), 46544#(<= main_~i~2 35), 46545#(<= main_~i~2 36), 46546#(<= main_~i~2 37), 46547#(<= main_~i~2 38), 46548#(<= main_~i~2 39), 46549#(<= main_~i~2 40), 46550#(<= main_~i~2 41), 46551#(<= main_~i~2 42), 46552#(<= main_~i~2 43), 46553#(<= main_~i~2 44), 46554#(<= main_~i~2 45), 46555#(<= main_~i~2 46), 46556#(<= main_~i~2 47), 46557#(<= main_~i~2 48), 46558#(<= main_~i~2 49), 46559#(<= main_~i~2 50), 46560#(<= main_~i~2 51), 46561#(<= main_~i~2 52), 46562#(<= main_~i~2 53), 46563#(<= main_~i~2 54), 46564#(<= main_~i~2 55), 46565#(<= main_~i~2 56), 46566#(<= main_~i~2 57), 46567#(<= main_~i~2 58), 46568#(<= main_~i~2 59), 46569#(<= main_~i~2 60)] [2018-04-12 04:52:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 146978 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 134468 trivial. 0 not checked. [2018-04-12 04:52:08,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-12 04:52:08,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-12 04:52:08,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-12 04:52:08,271 INFO L87 Difference]: Start difference. First operand 535 states and 597 transitions. Second operand 63 states. [2018-04-12 04:52:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:52:08,945 INFO L93 Difference]: Finished difference Result 547 states and 611 transitions. [2018-04-12 04:52:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-12 04:52:08,945 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 2801 [2018-04-12 04:52:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:52:08,947 INFO L225 Difference]: With dead ends: 547 [2018-04-12 04:52:08,947 INFO L226 Difference]: Without dead ends: 547 [2018-04-12 04:52:08,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-12 04:52:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-12 04:52:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 542. [2018-04-12 04:52:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-12 04:52:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 605 transitions. [2018-04-12 04:52:08,951 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 605 transitions. Word has length 2801 [2018-04-12 04:52:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:52:08,952 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 605 transitions. [2018-04-12 04:52:08,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-12 04:52:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 605 transitions. [2018-04-12 04:52:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2849 [2018-04-12 04:52:08,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:52:08,980 INFO L355 BasicCegarLoop]: trace histogram [180, 180, 119, 119, 119, 119, 119, 119, 119, 119, 119, 62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:52:08,980 INFO L408 AbstractCegarLoop]: === Iteration 82 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:52:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 348187917, now seen corresponding path program 59 times [2018-04-12 04:52:08,980 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:52:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:52:09,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:52:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 152019 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 139087 trivial. 0 not checked. [2018-04-12 04:52:29,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:52:29,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-12 04:52:29,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:52:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 68440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68440 trivial. 0 not checked. [2018-04-12 04:52:29,045 INFO L182 omatonBuilderFactory]: Interpolants [47659#true, 47660#false, 47661#(= main_~i~2 0), 47662#(<= main_~i~2 1), 47663#(<= main_~i~2 2), 47664#(<= main_~i~2 3), 47665#(<= main_~i~2 4), 47666#(<= main_~i~2 5), 47667#(<= main_~i~2 6), 47668#(<= main_~i~2 7), 47669#(<= main_~i~2 8), 47670#(<= main_~i~2 9), 47671#(<= main_~i~2 10), 47672#(<= main_~i~2 11), 47673#(<= main_~i~2 12), 47674#(<= main_~i~2 13), 47675#(<= main_~i~2 14), 47676#(<= main_~i~2 15), 47677#(<= main_~i~2 16), 47678#(<= main_~i~2 17), 47679#(<= main_~i~2 18), 47680#(<= main_~i~2 19), 47681#(<= main_~i~2 20), 47682#(<= main_~i~2 21), 47683#(<= main_~i~2 22), 47684#(<= main_~i~2 23), 47685#(<= main_~i~2 24), 47686#(<= main_~i~2 25), 47687#(<= main_~i~2 26), 47688#(<= main_~i~2 27), 47689#(<= main_~i~2 28), 47690#(<= main_~i~2 29), 47691#(<= main_~i~2 30), 47692#(<= main_~i~2 31), 47693#(<= main_~i~2 32), 47694#(<= main_~i~2 33), 47695#(<= main_~i~2 34), 47696#(<= main_~i~2 35), 47697#(<= main_~i~2 36), 47698#(<= main_~i~2 37), 47699#(<= main_~i~2 38), 47700#(<= main_~i~2 39), 47701#(<= main_~i~2 40), 47702#(<= main_~i~2 41), 47703#(<= main_~i~2 42), 47704#(<= main_~i~2 43), 47705#(<= main_~i~2 44), 47706#(<= main_~i~2 45), 47707#(<= main_~i~2 46), 47708#(<= main_~i~2 47), 47709#(<= main_~i~2 48), 47710#(<= main_~i~2 49), 47711#(<= main_~i~2 50), 47712#(<= main_~i~2 51), 47713#(<= main_~i~2 52), 47714#(<= main_~i~2 53), 47715#(<= main_~i~2 54), 47716#(<= main_~i~2 55), 47717#(<= main_~i~2 56), 47718#(<= main_~i~2 57), 47719#(<= main_~i~2 58), 47720#(<= main_~i~2 59), 47721#(<= main_~i~2 60), 47722#(<= main_~i~2 61)] [2018-04-12 04:52:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 152019 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 139087 trivial. 0 not checked. [2018-04-12 04:52:29,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-12 04:52:29,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-12 04:52:29,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 04:52:29,047 INFO L87 Difference]: Start difference. First operand 542 states and 605 transitions. Second operand 64 states. [2018-04-12 04:52:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:52:29,744 INFO L93 Difference]: Finished difference Result 554 states and 619 transitions. [2018-04-12 04:52:29,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-12 04:52:29,744 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2848 [2018-04-12 04:52:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:52:29,746 INFO L225 Difference]: With dead ends: 554 [2018-04-12 04:52:29,746 INFO L226 Difference]: Without dead ends: 554 [2018-04-12 04:52:29,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 04:52:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-12 04:52:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 549. [2018-04-12 04:52:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-04-12 04:52:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 613 transitions. [2018-04-12 04:52:29,750 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 613 transitions. Word has length 2848 [2018-04-12 04:52:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:52:29,751 INFO L459 AbstractCegarLoop]: Abstraction has 549 states and 613 transitions. [2018-04-12 04:52:29,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-12 04:52:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 613 transitions. [2018-04-12 04:52:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2896 [2018-04-12 04:52:29,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:52:29,781 INFO L355 BasicCegarLoop]: trace histogram [183, 183, 121, 121, 121, 121, 121, 121, 121, 121, 121, 63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:52:29,781 INFO L408 AbstractCegarLoop]: === Iteration 83 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:52:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1290321741, now seen corresponding path program 60 times [2018-04-12 04:52:29,782 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:52:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:52:30,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:52:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 157145 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 143784 trivial. 0 not checked. [2018-04-12 04:52:50,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:52:50,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-12 04:52:50,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:52:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 70800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70800 trivial. 0 not checked. [2018-04-12 04:52:50,659 INFO L182 omatonBuilderFactory]: Interpolants [48826#true, 48827#false, 48828#(= main_~i~2 0), 48829#(<= main_~i~2 1), 48830#(<= main_~i~2 2), 48831#(<= main_~i~2 3), 48832#(<= main_~i~2 4), 48833#(<= main_~i~2 5), 48834#(<= main_~i~2 6), 48835#(<= main_~i~2 7), 48836#(<= main_~i~2 8), 48837#(<= main_~i~2 9), 48838#(<= main_~i~2 10), 48839#(<= main_~i~2 11), 48840#(<= main_~i~2 12), 48841#(<= main_~i~2 13), 48842#(<= main_~i~2 14), 48843#(<= main_~i~2 15), 48844#(<= main_~i~2 16), 48845#(<= main_~i~2 17), 48846#(<= main_~i~2 18), 48847#(<= main_~i~2 19), 48848#(<= main_~i~2 20), 48849#(<= main_~i~2 21), 48850#(<= main_~i~2 22), 48851#(<= main_~i~2 23), 48852#(<= main_~i~2 24), 48853#(<= main_~i~2 25), 48854#(<= main_~i~2 26), 48855#(<= main_~i~2 27), 48856#(<= main_~i~2 28), 48857#(<= main_~i~2 29), 48858#(<= main_~i~2 30), 48859#(<= main_~i~2 31), 48860#(<= main_~i~2 32), 48861#(<= main_~i~2 33), 48862#(<= main_~i~2 34), 48863#(<= main_~i~2 35), 48864#(<= main_~i~2 36), 48865#(<= main_~i~2 37), 48866#(<= main_~i~2 38), 48867#(<= main_~i~2 39), 48868#(<= main_~i~2 40), 48869#(<= main_~i~2 41), 48870#(<= main_~i~2 42), 48871#(<= main_~i~2 43), 48872#(<= main_~i~2 44), 48873#(<= main_~i~2 45), 48874#(<= main_~i~2 46), 48875#(<= main_~i~2 47), 48876#(<= main_~i~2 48), 48877#(<= main_~i~2 49), 48878#(<= main_~i~2 50), 48879#(<= main_~i~2 51), 48880#(<= main_~i~2 52), 48881#(<= main_~i~2 53), 48882#(<= main_~i~2 54), 48883#(<= main_~i~2 55), 48884#(<= main_~i~2 56), 48885#(<= main_~i~2 57), 48886#(<= main_~i~2 58), 48887#(<= main_~i~2 59), 48888#(<= main_~i~2 60), 48889#(<= main_~i~2 61), 48890#(<= main_~i~2 62)] [2018-04-12 04:52:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 157145 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 143784 trivial. 0 not checked. [2018-04-12 04:52:50,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-12 04:52:50,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-12 04:52:50,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 04:52:50,662 INFO L87 Difference]: Start difference. First operand 549 states and 613 transitions. Second operand 65 states. [2018-04-12 04:52:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:52:51,411 INFO L93 Difference]: Finished difference Result 561 states and 627 transitions. [2018-04-12 04:52:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 04:52:51,411 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 2895 [2018-04-12 04:52:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:52:51,414 INFO L225 Difference]: With dead ends: 561 [2018-04-12 04:52:51,414 INFO L226 Difference]: Without dead ends: 561 [2018-04-12 04:52:51,414 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 04:52:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-12 04:52:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 556. [2018-04-12 04:52:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-04-12 04:52:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 621 transitions. [2018-04-12 04:52:51,419 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 621 transitions. Word has length 2895 [2018-04-12 04:52:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:52:51,420 INFO L459 AbstractCegarLoop]: Abstraction has 556 states and 621 transitions. [2018-04-12 04:52:51,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-12 04:52:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 621 transitions. [2018-04-12 04:52:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2943 [2018-04-12 04:52:51,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:52:51,452 INFO L355 BasicCegarLoop]: trace histogram [186, 186, 123, 123, 123, 123, 123, 123, 123, 123, 123, 64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:52:51,452 INFO L408 AbstractCegarLoop]: === Iteration 84 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:52:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash -505314227, now seen corresponding path program 61 times [2018-04-12 04:52:51,453 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:52:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:52:51,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:53:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 162356 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 148559 trivial. 0 not checked. [2018-04-12 04:53:13,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:53:13,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 04:53:13,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:53:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 73200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73200 trivial. 0 not checked. [2018-04-12 04:53:13,577 INFO L182 omatonBuilderFactory]: Interpolants [50048#(<= main_~i~2 38), 50049#(<= main_~i~2 39), 50050#(<= main_~i~2 40), 50051#(<= main_~i~2 41), 50052#(<= main_~i~2 42), 50053#(<= main_~i~2 43), 50054#(<= main_~i~2 44), 50055#(<= main_~i~2 45), 50056#(<= main_~i~2 46), 50057#(<= main_~i~2 47), 50058#(<= main_~i~2 48), 50059#(<= main_~i~2 49), 50060#(<= main_~i~2 50), 50061#(<= main_~i~2 51), 50062#(<= main_~i~2 52), 50063#(<= main_~i~2 53), 50064#(<= main_~i~2 54), 50065#(<= main_~i~2 55), 50066#(<= main_~i~2 56), 50067#(<= main_~i~2 57), 50068#(<= main_~i~2 58), 50069#(<= main_~i~2 59), 50070#(<= main_~i~2 60), 50071#(<= main_~i~2 61), 50072#(<= main_~i~2 62), 50073#(<= main_~i~2 63), 50008#true, 50009#false, 50010#(= main_~i~2 0), 50011#(<= main_~i~2 1), 50012#(<= main_~i~2 2), 50013#(<= main_~i~2 3), 50014#(<= main_~i~2 4), 50015#(<= main_~i~2 5), 50016#(<= main_~i~2 6), 50017#(<= main_~i~2 7), 50018#(<= main_~i~2 8), 50019#(<= main_~i~2 9), 50020#(<= main_~i~2 10), 50021#(<= main_~i~2 11), 50022#(<= main_~i~2 12), 50023#(<= main_~i~2 13), 50024#(<= main_~i~2 14), 50025#(<= main_~i~2 15), 50026#(<= main_~i~2 16), 50027#(<= main_~i~2 17), 50028#(<= main_~i~2 18), 50029#(<= main_~i~2 19), 50030#(<= main_~i~2 20), 50031#(<= main_~i~2 21), 50032#(<= main_~i~2 22), 50033#(<= main_~i~2 23), 50034#(<= main_~i~2 24), 50035#(<= main_~i~2 25), 50036#(<= main_~i~2 26), 50037#(<= main_~i~2 27), 50038#(<= main_~i~2 28), 50039#(<= main_~i~2 29), 50040#(<= main_~i~2 30), 50041#(<= main_~i~2 31), 50042#(<= main_~i~2 32), 50043#(<= main_~i~2 33), 50044#(<= main_~i~2 34), 50045#(<= main_~i~2 35), 50046#(<= main_~i~2 36), 50047#(<= main_~i~2 37)] [2018-04-12 04:53:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 162356 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 148559 trivial. 0 not checked. [2018-04-12 04:53:13,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 04:53:13,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 04:53:13,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 04:53:13,580 INFO L87 Difference]: Start difference. First operand 556 states and 621 transitions. Second operand 66 states. [2018-04-12 04:53:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:53:14,028 INFO L93 Difference]: Finished difference Result 568 states and 635 transitions. [2018-04-12 04:53:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-12 04:53:14,029 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2942 [2018-04-12 04:53:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:53:14,031 INFO L225 Difference]: With dead ends: 568 [2018-04-12 04:53:14,031 INFO L226 Difference]: Without dead ends: 568 [2018-04-12 04:53:14,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 04:53:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-04-12 04:53:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 563. [2018-04-12 04:53:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-12 04:53:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 629 transitions. [2018-04-12 04:53:14,034 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 629 transitions. Word has length 2942 [2018-04-12 04:53:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:53:14,035 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 629 transitions. [2018-04-12 04:53:14,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 04:53:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 629 transitions. [2018-04-12 04:53:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2990 [2018-04-12 04:53:14,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:53:14,065 INFO L355 BasicCegarLoop]: trace histogram [189, 189, 125, 125, 125, 125, 125, 125, 125, 125, 125, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:53:14,065 INFO L408 AbstractCegarLoop]: === Iteration 85 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:53:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2048541043, now seen corresponding path program 62 times [2018-04-12 04:53:14,066 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:53:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:53:14,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:53:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 167652 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 153412 trivial. 0 not checked. [2018-04-12 04:53:37,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:53:37,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-12 04:53:37,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:53:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 75640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75640 trivial. 0 not checked. [2018-04-12 04:53:37,149 INFO L182 omatonBuilderFactory]: Interpolants [51205#true, 51206#false, 51207#(= main_~i~2 0), 51208#(<= main_~i~2 1), 51209#(<= main_~i~2 2), 51210#(<= main_~i~2 3), 51211#(<= main_~i~2 4), 51212#(<= main_~i~2 5), 51213#(<= main_~i~2 6), 51214#(<= main_~i~2 7), 51215#(<= main_~i~2 8), 51216#(<= main_~i~2 9), 51217#(<= main_~i~2 10), 51218#(<= main_~i~2 11), 51219#(<= main_~i~2 12), 51220#(<= main_~i~2 13), 51221#(<= main_~i~2 14), 51222#(<= main_~i~2 15), 51223#(<= main_~i~2 16), 51224#(<= main_~i~2 17), 51225#(<= main_~i~2 18), 51226#(<= main_~i~2 19), 51227#(<= main_~i~2 20), 51228#(<= main_~i~2 21), 51229#(<= main_~i~2 22), 51230#(<= main_~i~2 23), 51231#(<= main_~i~2 24), 51232#(<= main_~i~2 25), 51233#(<= main_~i~2 26), 51234#(<= main_~i~2 27), 51235#(<= main_~i~2 28), 51236#(<= main_~i~2 29), 51237#(<= main_~i~2 30), 51238#(<= main_~i~2 31), 51239#(<= main_~i~2 32), 51240#(<= main_~i~2 33), 51241#(<= main_~i~2 34), 51242#(<= main_~i~2 35), 51243#(<= main_~i~2 36), 51244#(<= main_~i~2 37), 51245#(<= main_~i~2 38), 51246#(<= main_~i~2 39), 51247#(<= main_~i~2 40), 51248#(<= main_~i~2 41), 51249#(<= main_~i~2 42), 51250#(<= main_~i~2 43), 51251#(<= main_~i~2 44), 51252#(<= main_~i~2 45), 51253#(<= main_~i~2 46), 51254#(<= main_~i~2 47), 51255#(<= main_~i~2 48), 51256#(<= main_~i~2 49), 51257#(<= main_~i~2 50), 51258#(<= main_~i~2 51), 51259#(<= main_~i~2 52), 51260#(<= main_~i~2 53), 51261#(<= main_~i~2 54), 51262#(<= main_~i~2 55), 51263#(<= main_~i~2 56), 51264#(<= main_~i~2 57), 51265#(<= main_~i~2 58), 51266#(<= main_~i~2 59), 51267#(<= main_~i~2 60), 51268#(<= main_~i~2 61), 51269#(<= main_~i~2 62), 51270#(<= main_~i~2 63), 51271#(<= main_~i~2 64)] [2018-04-12 04:53:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 167652 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 153412 trivial. 0 not checked. [2018-04-12 04:53:37,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 04:53:37,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 04:53:37,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 04:53:37,152 INFO L87 Difference]: Start difference. First operand 563 states and 629 transitions. Second operand 67 states. [2018-04-12 04:53:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:53:37,964 INFO L93 Difference]: Finished difference Result 575 states and 643 transitions. [2018-04-12 04:53:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-12 04:53:37,965 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 2989 [2018-04-12 04:53:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:53:37,967 INFO L225 Difference]: With dead ends: 575 [2018-04-12 04:53:37,967 INFO L226 Difference]: Without dead ends: 575 [2018-04-12 04:53:37,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 04:53:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-12 04:53:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 570. [2018-04-12 04:53:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-04-12 04:53:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 637 transitions. [2018-04-12 04:53:37,971 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 637 transitions. Word has length 2989 [2018-04-12 04:53:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:53:37,972 INFO L459 AbstractCegarLoop]: Abstraction has 570 states and 637 transitions. [2018-04-12 04:53:37,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 04:53:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 637 transitions. [2018-04-12 04:53:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3037 [2018-04-12 04:53:38,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:53:38,005 INFO L355 BasicCegarLoop]: trace histogram [192, 192, 127, 127, 127, 127, 127, 127, 127, 127, 127, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:53:38,005 INFO L408 AbstractCegarLoop]: === Iteration 86 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:53:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2021125005, now seen corresponding path program 63 times [2018-04-12 04:53:38,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:53:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:53:38,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:54:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 173033 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 158343 trivial. 0 not checked. [2018-04-12 04:54:01,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:54:01,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-12 04:54:01,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:54:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 78120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78120 trivial. 0 not checked. [2018-04-12 04:54:01,501 INFO L182 omatonBuilderFactory]: Interpolants [52480#(<= main_~i~2 61), 52481#(<= main_~i~2 62), 52482#(<= main_~i~2 63), 52483#(<= main_~i~2 64), 52484#(<= main_~i~2 65), 52417#true, 52418#false, 52419#(= main_~i~2 0), 52420#(<= main_~i~2 1), 52421#(<= main_~i~2 2), 52422#(<= main_~i~2 3), 52423#(<= main_~i~2 4), 52424#(<= main_~i~2 5), 52425#(<= main_~i~2 6), 52426#(<= main_~i~2 7), 52427#(<= main_~i~2 8), 52428#(<= main_~i~2 9), 52429#(<= main_~i~2 10), 52430#(<= main_~i~2 11), 52431#(<= main_~i~2 12), 52432#(<= main_~i~2 13), 52433#(<= main_~i~2 14), 52434#(<= main_~i~2 15), 52435#(<= main_~i~2 16), 52436#(<= main_~i~2 17), 52437#(<= main_~i~2 18), 52438#(<= main_~i~2 19), 52439#(<= main_~i~2 20), 52440#(<= main_~i~2 21), 52441#(<= main_~i~2 22), 52442#(<= main_~i~2 23), 52443#(<= main_~i~2 24), 52444#(<= main_~i~2 25), 52445#(<= main_~i~2 26), 52446#(<= main_~i~2 27), 52447#(<= main_~i~2 28), 52448#(<= main_~i~2 29), 52449#(<= main_~i~2 30), 52450#(<= main_~i~2 31), 52451#(<= main_~i~2 32), 52452#(<= main_~i~2 33), 52453#(<= main_~i~2 34), 52454#(<= main_~i~2 35), 52455#(<= main_~i~2 36), 52456#(<= main_~i~2 37), 52457#(<= main_~i~2 38), 52458#(<= main_~i~2 39), 52459#(<= main_~i~2 40), 52460#(<= main_~i~2 41), 52461#(<= main_~i~2 42), 52462#(<= main_~i~2 43), 52463#(<= main_~i~2 44), 52464#(<= main_~i~2 45), 52465#(<= main_~i~2 46), 52466#(<= main_~i~2 47), 52467#(<= main_~i~2 48), 52468#(<= main_~i~2 49), 52469#(<= main_~i~2 50), 52470#(<= main_~i~2 51), 52471#(<= main_~i~2 52), 52472#(<= main_~i~2 53), 52473#(<= main_~i~2 54), 52474#(<= main_~i~2 55), 52475#(<= main_~i~2 56), 52476#(<= main_~i~2 57), 52477#(<= main_~i~2 58), 52478#(<= main_~i~2 59), 52479#(<= main_~i~2 60)] [2018-04-12 04:54:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 173033 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 158343 trivial. 0 not checked. [2018-04-12 04:54:01,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-12 04:54:01,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-12 04:54:01,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 04:54:01,504 INFO L87 Difference]: Start difference. First operand 570 states and 637 transitions. Second operand 68 states. [2018-04-12 04:54:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:54:02,707 INFO L93 Difference]: Finished difference Result 582 states and 651 transitions. [2018-04-12 04:54:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 04:54:02,708 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3036 [2018-04-12 04:54:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:54:02,711 INFO L225 Difference]: With dead ends: 582 [2018-04-12 04:54:02,711 INFO L226 Difference]: Without dead ends: 582 [2018-04-12 04:54:02,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 04:54:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-04-12 04:54:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 577. [2018-04-12 04:54:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-04-12 04:54:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 645 transitions. [2018-04-12 04:54:02,720 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 645 transitions. Word has length 3036 [2018-04-12 04:54:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:54:02,721 INFO L459 AbstractCegarLoop]: Abstraction has 577 states and 645 transitions. [2018-04-12 04:54:02,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-12 04:54:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 645 transitions. [2018-04-12 04:54:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3084 [2018-04-12 04:54:02,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:54:02,758 INFO L355 BasicCegarLoop]: trace histogram [195, 195, 129, 129, 129, 129, 129, 129, 129, 129, 129, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:54:02,759 INFO L408 AbstractCegarLoop]: === Iteration 87 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:54:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash -158502349, now seen corresponding path program 64 times [2018-04-12 04:54:02,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:54:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:54:03,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:54:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 178499 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 163352 trivial. 0 not checked. [2018-04-12 04:54:27,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:54:27,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-12 04:54:27,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:54:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 80640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80640 trivial. 0 not checked. [2018-04-12 04:54:27,662 INFO L182 omatonBuilderFactory]: Interpolants [53644#true, 53645#false, 53646#(= main_~i~2 0), 53647#(<= main_~i~2 1), 53648#(<= main_~i~2 2), 53649#(<= main_~i~2 3), 53650#(<= main_~i~2 4), 53651#(<= main_~i~2 5), 53652#(<= main_~i~2 6), 53653#(<= main_~i~2 7), 53654#(<= main_~i~2 8), 53655#(<= main_~i~2 9), 53656#(<= main_~i~2 10), 53657#(<= main_~i~2 11), 53658#(<= main_~i~2 12), 53659#(<= main_~i~2 13), 53660#(<= main_~i~2 14), 53661#(<= main_~i~2 15), 53662#(<= main_~i~2 16), 53663#(<= main_~i~2 17), 53664#(<= main_~i~2 18), 53665#(<= main_~i~2 19), 53666#(<= main_~i~2 20), 53667#(<= main_~i~2 21), 53668#(<= main_~i~2 22), 53669#(<= main_~i~2 23), 53670#(<= main_~i~2 24), 53671#(<= main_~i~2 25), 53672#(<= main_~i~2 26), 53673#(<= main_~i~2 27), 53674#(<= main_~i~2 28), 53675#(<= main_~i~2 29), 53676#(<= main_~i~2 30), 53677#(<= main_~i~2 31), 53678#(<= main_~i~2 32), 53679#(<= main_~i~2 33), 53680#(<= main_~i~2 34), 53681#(<= main_~i~2 35), 53682#(<= main_~i~2 36), 53683#(<= main_~i~2 37), 53684#(<= main_~i~2 38), 53685#(<= main_~i~2 39), 53686#(<= main_~i~2 40), 53687#(<= main_~i~2 41), 53688#(<= main_~i~2 42), 53689#(<= main_~i~2 43), 53690#(<= main_~i~2 44), 53691#(<= main_~i~2 45), 53692#(<= main_~i~2 46), 53693#(<= main_~i~2 47), 53694#(<= main_~i~2 48), 53695#(<= main_~i~2 49), 53696#(<= main_~i~2 50), 53697#(<= main_~i~2 51), 53698#(<= main_~i~2 52), 53699#(<= main_~i~2 53), 53700#(<= main_~i~2 54), 53701#(<= main_~i~2 55), 53702#(<= main_~i~2 56), 53703#(<= main_~i~2 57), 53704#(<= main_~i~2 58), 53705#(<= main_~i~2 59), 53706#(<= main_~i~2 60), 53707#(<= main_~i~2 61), 53708#(<= main_~i~2 62), 53709#(<= main_~i~2 63), 53710#(<= main_~i~2 64), 53711#(<= main_~i~2 65), 53712#(<= main_~i~2 66)] [2018-04-12 04:54:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 178499 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 163352 trivial. 0 not checked. [2018-04-12 04:54:27,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-12 04:54:27,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-12 04:54:27,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 04:54:27,665 INFO L87 Difference]: Start difference. First operand 577 states and 645 transitions. Second operand 69 states. [2018-04-12 04:54:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:54:28,521 INFO L93 Difference]: Finished difference Result 589 states and 659 transitions. [2018-04-12 04:54:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-12 04:54:28,521 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 3083 [2018-04-12 04:54:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:54:28,524 INFO L225 Difference]: With dead ends: 589 [2018-04-12 04:54:28,524 INFO L226 Difference]: Without dead ends: 589 [2018-04-12 04:54:28,524 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 04:54:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-12 04:54:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 584. [2018-04-12 04:54:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-04-12 04:54:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 653 transitions. [2018-04-12 04:54:28,531 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 653 transitions. Word has length 3083 [2018-04-12 04:54:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:54:28,532 INFO L459 AbstractCegarLoop]: Abstraction has 584 states and 653 transitions. [2018-04-12 04:54:28,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-12 04:54:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 653 transitions. [2018-04-12 04:54:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3131 [2018-04-12 04:54:28,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:54:28,567 INFO L355 BasicCegarLoop]: trace histogram [198, 198, 131, 131, 131, 131, 131, 131, 131, 131, 131, 68, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:54:28,567 INFO L408 AbstractCegarLoop]: === Iteration 88 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:54:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1980226867, now seen corresponding path program 65 times [2018-04-12 04:54:28,568 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:54:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:54:28,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:54:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 184050 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 168439 trivial. 0 not checked. [2018-04-12 04:54:54,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:54:54,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-12 04:54:54,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:54:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 83200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83200 trivial. 0 not checked. [2018-04-12 04:54:54,750 INFO L182 omatonBuilderFactory]: Interpolants [54912#(<= main_~i~2 24), 54913#(<= main_~i~2 25), 54914#(<= main_~i~2 26), 54915#(<= main_~i~2 27), 54916#(<= main_~i~2 28), 54917#(<= main_~i~2 29), 54918#(<= main_~i~2 30), 54919#(<= main_~i~2 31), 54920#(<= main_~i~2 32), 54921#(<= main_~i~2 33), 54922#(<= main_~i~2 34), 54923#(<= main_~i~2 35), 54924#(<= main_~i~2 36), 54925#(<= main_~i~2 37), 54926#(<= main_~i~2 38), 54927#(<= main_~i~2 39), 54928#(<= main_~i~2 40), 54929#(<= main_~i~2 41), 54930#(<= main_~i~2 42), 54931#(<= main_~i~2 43), 54932#(<= main_~i~2 44), 54933#(<= main_~i~2 45), 54934#(<= main_~i~2 46), 54935#(<= main_~i~2 47), 54936#(<= main_~i~2 48), 54937#(<= main_~i~2 49), 54938#(<= main_~i~2 50), 54939#(<= main_~i~2 51), 54940#(<= main_~i~2 52), 54941#(<= main_~i~2 53), 54942#(<= main_~i~2 54), 54943#(<= main_~i~2 55), 54944#(<= main_~i~2 56), 54945#(<= main_~i~2 57), 54946#(<= main_~i~2 58), 54947#(<= main_~i~2 59), 54948#(<= main_~i~2 60), 54949#(<= main_~i~2 61), 54950#(<= main_~i~2 62), 54951#(<= main_~i~2 63), 54952#(<= main_~i~2 64), 54953#(<= main_~i~2 65), 54954#(<= main_~i~2 66), 54955#(<= main_~i~2 67), 54886#true, 54887#false, 54888#(= main_~i~2 0), 54889#(<= main_~i~2 1), 54890#(<= main_~i~2 2), 54891#(<= main_~i~2 3), 54892#(<= main_~i~2 4), 54893#(<= main_~i~2 5), 54894#(<= main_~i~2 6), 54895#(<= main_~i~2 7), 54896#(<= main_~i~2 8), 54897#(<= main_~i~2 9), 54898#(<= main_~i~2 10), 54899#(<= main_~i~2 11), 54900#(<= main_~i~2 12), 54901#(<= main_~i~2 13), 54902#(<= main_~i~2 14), 54903#(<= main_~i~2 15), 54904#(<= main_~i~2 16), 54905#(<= main_~i~2 17), 54906#(<= main_~i~2 18), 54907#(<= main_~i~2 19), 54908#(<= main_~i~2 20), 54909#(<= main_~i~2 21), 54910#(<= main_~i~2 22), 54911#(<= main_~i~2 23)] [2018-04-12 04:54:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 184050 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 168439 trivial. 0 not checked. [2018-04-12 04:54:54,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-12 04:54:54,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-12 04:54:54,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 04:54:54,753 INFO L87 Difference]: Start difference. First operand 584 states and 653 transitions. Second operand 70 states. [2018-04-12 04:54:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:54:55,356 INFO L93 Difference]: Finished difference Result 596 states and 667 transitions. [2018-04-12 04:54:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-12 04:54:55,356 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3130 [2018-04-12 04:54:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:54:55,358 INFO L225 Difference]: With dead ends: 596 [2018-04-12 04:54:55,358 INFO L226 Difference]: Without dead ends: 596 [2018-04-12 04:54:55,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 04:54:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-04-12 04:54:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 591. [2018-04-12 04:54:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-04-12 04:54:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 661 transitions. [2018-04-12 04:54:55,362 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 661 transitions. Word has length 3130 [2018-04-12 04:54:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:54:55,363 INFO L459 AbstractCegarLoop]: Abstraction has 591 states and 661 transitions. [2018-04-12 04:54:55,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-12 04:54:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 661 transitions. [2018-04-12 04:54:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3178 [2018-04-12 04:54:55,397 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:54:55,421 INFO L355 BasicCegarLoop]: trace histogram [201, 201, 133, 133, 133, 133, 133, 133, 133, 133, 133, 69, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:54:55,421 INFO L408 AbstractCegarLoop]: === Iteration 89 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:54:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1333996813, now seen corresponding path program 66 times [2018-04-12 04:54:55,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:54:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:54:55,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:55:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 189686 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 173604 trivial. 0 not checked. [2018-04-12 04:55:23,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:55:23,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-12 04:55:23,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:55:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 85800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85800 trivial. 0 not checked. [2018-04-12 04:55:23,473 INFO L182 omatonBuilderFactory]: Interpolants [56192#(<= main_~i~2 47), 56193#(<= main_~i~2 48), 56194#(<= main_~i~2 49), 56195#(<= main_~i~2 50), 56196#(<= main_~i~2 51), 56197#(<= main_~i~2 52), 56198#(<= main_~i~2 53), 56199#(<= main_~i~2 54), 56200#(<= main_~i~2 55), 56201#(<= main_~i~2 56), 56202#(<= main_~i~2 57), 56203#(<= main_~i~2 58), 56204#(<= main_~i~2 59), 56205#(<= main_~i~2 60), 56206#(<= main_~i~2 61), 56207#(<= main_~i~2 62), 56208#(<= main_~i~2 63), 56209#(<= main_~i~2 64), 56210#(<= main_~i~2 65), 56211#(<= main_~i~2 66), 56212#(<= main_~i~2 67), 56213#(<= main_~i~2 68), 56143#true, 56144#false, 56145#(= main_~i~2 0), 56146#(<= main_~i~2 1), 56147#(<= main_~i~2 2), 56148#(<= main_~i~2 3), 56149#(<= main_~i~2 4), 56150#(<= main_~i~2 5), 56151#(<= main_~i~2 6), 56152#(<= main_~i~2 7), 56153#(<= main_~i~2 8), 56154#(<= main_~i~2 9), 56155#(<= main_~i~2 10), 56156#(<= main_~i~2 11), 56157#(<= main_~i~2 12), 56158#(<= main_~i~2 13), 56159#(<= main_~i~2 14), 56160#(<= main_~i~2 15), 56161#(<= main_~i~2 16), 56162#(<= main_~i~2 17), 56163#(<= main_~i~2 18), 56164#(<= main_~i~2 19), 56165#(<= main_~i~2 20), 56166#(<= main_~i~2 21), 56167#(<= main_~i~2 22), 56168#(<= main_~i~2 23), 56169#(<= main_~i~2 24), 56170#(<= main_~i~2 25), 56171#(<= main_~i~2 26), 56172#(<= main_~i~2 27), 56173#(<= main_~i~2 28), 56174#(<= main_~i~2 29), 56175#(<= main_~i~2 30), 56176#(<= main_~i~2 31), 56177#(<= main_~i~2 32), 56178#(<= main_~i~2 33), 56179#(<= main_~i~2 34), 56180#(<= main_~i~2 35), 56181#(<= main_~i~2 36), 56182#(<= main_~i~2 37), 56183#(<= main_~i~2 38), 56184#(<= main_~i~2 39), 56185#(<= main_~i~2 40), 56186#(<= main_~i~2 41), 56187#(<= main_~i~2 42), 56188#(<= main_~i~2 43), 56189#(<= main_~i~2 44), 56190#(<= main_~i~2 45), 56191#(<= main_~i~2 46)] [2018-04-12 04:55:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 189686 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 173604 trivial. 0 not checked. [2018-04-12 04:55:23,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-12 04:55:23,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-12 04:55:23,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-12 04:55:23,476 INFO L87 Difference]: Start difference. First operand 591 states and 661 transitions. Second operand 71 states. [2018-04-12 04:55:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:55:24,052 INFO L93 Difference]: Finished difference Result 603 states and 675 transitions. [2018-04-12 04:55:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-12 04:55:24,052 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 3177 [2018-04-12 04:55:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:55:24,055 INFO L225 Difference]: With dead ends: 603 [2018-04-12 04:55:24,055 INFO L226 Difference]: Without dead ends: 603 [2018-04-12 04:55:24,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-12 04:55:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-04-12 04:55:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2018-04-12 04:55:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-12 04:55:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 669 transitions. [2018-04-12 04:55:24,059 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 669 transitions. Word has length 3177 [2018-04-12 04:55:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:55:24,060 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 669 transitions. [2018-04-12 04:55:24,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-12 04:55:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 669 transitions. [2018-04-12 04:55:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3225 [2018-04-12 04:55:24,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:55:24,097 INFO L355 BasicCegarLoop]: trace histogram [204, 204, 135, 135, 135, 135, 135, 135, 135, 135, 135, 70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:55:24,097 INFO L408 AbstractCegarLoop]: === Iteration 90 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:55:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 618015245, now seen corresponding path program 67 times [2018-04-12 04:55:24,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:55:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:55:24,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:55:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 195407 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 178847 trivial. 0 not checked. [2018-04-12 04:55:52,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:55:52,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-12 04:55:52,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:55:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 88440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88440 trivial. 0 not checked. [2018-04-12 04:55:52,249 INFO L182 omatonBuilderFactory]: Interpolants [57472#(<= main_~i~2 55), 57473#(<= main_~i~2 56), 57474#(<= main_~i~2 57), 57475#(<= main_~i~2 58), 57476#(<= main_~i~2 59), 57477#(<= main_~i~2 60), 57478#(<= main_~i~2 61), 57479#(<= main_~i~2 62), 57480#(<= main_~i~2 63), 57481#(<= main_~i~2 64), 57482#(<= main_~i~2 65), 57483#(<= main_~i~2 66), 57484#(<= main_~i~2 67), 57485#(<= main_~i~2 68), 57486#(<= main_~i~2 69), 57415#true, 57416#false, 57417#(= main_~i~2 0), 57418#(<= main_~i~2 1), 57419#(<= main_~i~2 2), 57420#(<= main_~i~2 3), 57421#(<= main_~i~2 4), 57422#(<= main_~i~2 5), 57423#(<= main_~i~2 6), 57424#(<= main_~i~2 7), 57425#(<= main_~i~2 8), 57426#(<= main_~i~2 9), 57427#(<= main_~i~2 10), 57428#(<= main_~i~2 11), 57429#(<= main_~i~2 12), 57430#(<= main_~i~2 13), 57431#(<= main_~i~2 14), 57432#(<= main_~i~2 15), 57433#(<= main_~i~2 16), 57434#(<= main_~i~2 17), 57435#(<= main_~i~2 18), 57436#(<= main_~i~2 19), 57437#(<= main_~i~2 20), 57438#(<= main_~i~2 21), 57439#(<= main_~i~2 22), 57440#(<= main_~i~2 23), 57441#(<= main_~i~2 24), 57442#(<= main_~i~2 25), 57443#(<= main_~i~2 26), 57444#(<= main_~i~2 27), 57445#(<= main_~i~2 28), 57446#(<= main_~i~2 29), 57447#(<= main_~i~2 30), 57448#(<= main_~i~2 31), 57449#(<= main_~i~2 32), 57450#(<= main_~i~2 33), 57451#(<= main_~i~2 34), 57452#(<= main_~i~2 35), 57453#(<= main_~i~2 36), 57454#(<= main_~i~2 37), 57455#(<= main_~i~2 38), 57456#(<= main_~i~2 39), 57457#(<= main_~i~2 40), 57458#(<= main_~i~2 41), 57459#(<= main_~i~2 42), 57460#(<= main_~i~2 43), 57461#(<= main_~i~2 44), 57462#(<= main_~i~2 45), 57463#(<= main_~i~2 46), 57464#(<= main_~i~2 47), 57465#(<= main_~i~2 48), 57466#(<= main_~i~2 49), 57467#(<= main_~i~2 50), 57468#(<= main_~i~2 51), 57469#(<= main_~i~2 52), 57470#(<= main_~i~2 53), 57471#(<= main_~i~2 54)] [2018-04-12 04:55:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 195407 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 178847 trivial. 0 not checked. [2018-04-12 04:55:52,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-12 04:55:52,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-12 04:55:52,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 04:55:52,252 INFO L87 Difference]: Start difference. First operand 598 states and 669 transitions. Second operand 72 states. [2018-04-12 04:55:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:55:52,925 INFO L93 Difference]: Finished difference Result 610 states and 683 transitions. [2018-04-12 04:55:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-12 04:55:52,925 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 3224 [2018-04-12 04:55:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:55:52,927 INFO L225 Difference]: With dead ends: 610 [2018-04-12 04:55:52,928 INFO L226 Difference]: Without dead ends: 610 [2018-04-12 04:55:52,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 04:55:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-04-12 04:55:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2018-04-12 04:55:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-12 04:55:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 677 transitions. [2018-04-12 04:55:52,932 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 677 transitions. Word has length 3224 [2018-04-12 04:55:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:55:52,933 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 677 transitions. [2018-04-12 04:55:52,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-12 04:55:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 677 transitions. [2018-04-12 04:55:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3272 [2018-04-12 04:55:52,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:55:52,970 INFO L355 BasicCegarLoop]: trace histogram [207, 207, 137, 137, 137, 137, 137, 137, 137, 137, 137, 71, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:55:52,970 INFO L408 AbstractCegarLoop]: === Iteration 91 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:55:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 854877107, now seen corresponding path program 68 times [2018-04-12 04:55:52,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:55:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:55:53,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:56:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 201213 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 184168 trivial. 0 not checked. [2018-04-12 04:56:22,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:56:22,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-12 04:56:22,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:56:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 91120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91120 trivial. 0 not checked. [2018-04-12 04:56:22,727 INFO L182 omatonBuilderFactory]: Interpolants [58752#(<= main_~i~2 48), 58753#(<= main_~i~2 49), 58754#(<= main_~i~2 50), 58755#(<= main_~i~2 51), 58756#(<= main_~i~2 52), 58757#(<= main_~i~2 53), 58758#(<= main_~i~2 54), 58759#(<= main_~i~2 55), 58760#(<= main_~i~2 56), 58761#(<= main_~i~2 57), 58762#(<= main_~i~2 58), 58763#(<= main_~i~2 59), 58764#(<= main_~i~2 60), 58765#(<= main_~i~2 61), 58766#(<= main_~i~2 62), 58767#(<= main_~i~2 63), 58768#(<= main_~i~2 64), 58769#(<= main_~i~2 65), 58770#(<= main_~i~2 66), 58771#(<= main_~i~2 67), 58772#(<= main_~i~2 68), 58773#(<= main_~i~2 69), 58774#(<= main_~i~2 70), 58702#true, 58703#false, 58704#(= main_~i~2 0), 58705#(<= main_~i~2 1), 58706#(<= main_~i~2 2), 58707#(<= main_~i~2 3), 58708#(<= main_~i~2 4), 58709#(<= main_~i~2 5), 58710#(<= main_~i~2 6), 58711#(<= main_~i~2 7), 58712#(<= main_~i~2 8), 58713#(<= main_~i~2 9), 58714#(<= main_~i~2 10), 58715#(<= main_~i~2 11), 58716#(<= main_~i~2 12), 58717#(<= main_~i~2 13), 58718#(<= main_~i~2 14), 58719#(<= main_~i~2 15), 58720#(<= main_~i~2 16), 58721#(<= main_~i~2 17), 58722#(<= main_~i~2 18), 58723#(<= main_~i~2 19), 58724#(<= main_~i~2 20), 58725#(<= main_~i~2 21), 58726#(<= main_~i~2 22), 58727#(<= main_~i~2 23), 58728#(<= main_~i~2 24), 58729#(<= main_~i~2 25), 58730#(<= main_~i~2 26), 58731#(<= main_~i~2 27), 58732#(<= main_~i~2 28), 58733#(<= main_~i~2 29), 58734#(<= main_~i~2 30), 58735#(<= main_~i~2 31), 58736#(<= main_~i~2 32), 58737#(<= main_~i~2 33), 58738#(<= main_~i~2 34), 58739#(<= main_~i~2 35), 58740#(<= main_~i~2 36), 58741#(<= main_~i~2 37), 58742#(<= main_~i~2 38), 58743#(<= main_~i~2 39), 58744#(<= main_~i~2 40), 58745#(<= main_~i~2 41), 58746#(<= main_~i~2 42), 58747#(<= main_~i~2 43), 58748#(<= main_~i~2 44), 58749#(<= main_~i~2 45), 58750#(<= main_~i~2 46), 58751#(<= main_~i~2 47)] [2018-04-12 04:56:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 201213 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 184168 trivial. 0 not checked. [2018-04-12 04:56:22,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-12 04:56:22,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-12 04:56:22,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-12 04:56:22,731 INFO L87 Difference]: Start difference. First operand 605 states and 677 transitions. Second operand 73 states. [2018-04-12 04:56:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:56:23,364 INFO L93 Difference]: Finished difference Result 617 states and 691 transitions. [2018-04-12 04:56:23,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-12 04:56:23,364 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 3271 [2018-04-12 04:56:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:56:23,366 INFO L225 Difference]: With dead ends: 617 [2018-04-12 04:56:23,366 INFO L226 Difference]: Without dead ends: 617 [2018-04-12 04:56:23,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-12 04:56:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-04-12 04:56:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 612. [2018-04-12 04:56:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-04-12 04:56:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 685 transitions. [2018-04-12 04:56:23,371 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 685 transitions. Word has length 3271 [2018-04-12 04:56:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:56:23,372 INFO L459 AbstractCegarLoop]: Abstraction has 612 states and 685 transitions. [2018-04-12 04:56:23,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-12 04:56:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 685 transitions. [2018-04-12 04:56:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3319 [2018-04-12 04:56:23,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:56:23,411 INFO L355 BasicCegarLoop]: trace histogram [210, 210, 139, 139, 139, 139, 139, 139, 139, 139, 139, 72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:56:23,411 INFO L408 AbstractCegarLoop]: === Iteration 92 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:56:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash -192544435, now seen corresponding path program 69 times [2018-04-12 04:56:23,411 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:56:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:56:23,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:56:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 207104 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 189567 trivial. 0 not checked. [2018-04-12 04:56:54,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:56:54,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-12 04:56:54,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:56:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 93840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93840 trivial. 0 not checked. [2018-04-12 04:56:54,496 INFO L182 omatonBuilderFactory]: Interpolants [60032#(<= main_~i~2 26), 60033#(<= main_~i~2 27), 60034#(<= main_~i~2 28), 60035#(<= main_~i~2 29), 60036#(<= main_~i~2 30), 60037#(<= main_~i~2 31), 60038#(<= main_~i~2 32), 60039#(<= main_~i~2 33), 60040#(<= main_~i~2 34), 60041#(<= main_~i~2 35), 60042#(<= main_~i~2 36), 60043#(<= main_~i~2 37), 60044#(<= main_~i~2 38), 60045#(<= main_~i~2 39), 60046#(<= main_~i~2 40), 60047#(<= main_~i~2 41), 60048#(<= main_~i~2 42), 60049#(<= main_~i~2 43), 60050#(<= main_~i~2 44), 60051#(<= main_~i~2 45), 60052#(<= main_~i~2 46), 60053#(<= main_~i~2 47), 60054#(<= main_~i~2 48), 60055#(<= main_~i~2 49), 60056#(<= main_~i~2 50), 60057#(<= main_~i~2 51), 60058#(<= main_~i~2 52), 60059#(<= main_~i~2 53), 60060#(<= main_~i~2 54), 60061#(<= main_~i~2 55), 60062#(<= main_~i~2 56), 60063#(<= main_~i~2 57), 60064#(<= main_~i~2 58), 60065#(<= main_~i~2 59), 60066#(<= main_~i~2 60), 60067#(<= main_~i~2 61), 60068#(<= main_~i~2 62), 60069#(<= main_~i~2 63), 60070#(<= main_~i~2 64), 60071#(<= main_~i~2 65), 60072#(<= main_~i~2 66), 60073#(<= main_~i~2 67), 60074#(<= main_~i~2 68), 60075#(<= main_~i~2 69), 60076#(<= main_~i~2 70), 60077#(<= main_~i~2 71), 60004#true, 60005#false, 60006#(= main_~i~2 0), 60007#(<= main_~i~2 1), 60008#(<= main_~i~2 2), 60009#(<= main_~i~2 3), 60010#(<= main_~i~2 4), 60011#(<= main_~i~2 5), 60012#(<= main_~i~2 6), 60013#(<= main_~i~2 7), 60014#(<= main_~i~2 8), 60015#(<= main_~i~2 9), 60016#(<= main_~i~2 10), 60017#(<= main_~i~2 11), 60018#(<= main_~i~2 12), 60019#(<= main_~i~2 13), 60020#(<= main_~i~2 14), 60021#(<= main_~i~2 15), 60022#(<= main_~i~2 16), 60023#(<= main_~i~2 17), 60024#(<= main_~i~2 18), 60025#(<= main_~i~2 19), 60026#(<= main_~i~2 20), 60027#(<= main_~i~2 21), 60028#(<= main_~i~2 22), 60029#(<= main_~i~2 23), 60030#(<= main_~i~2 24), 60031#(<= main_~i~2 25)] [2018-04-12 04:56:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 207104 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 189567 trivial. 0 not checked. [2018-04-12 04:56:54,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-12 04:56:54,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-12 04:56:54,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 04:56:54,500 INFO L87 Difference]: Start difference. First operand 612 states and 685 transitions. Second operand 74 states. [2018-04-12 04:56:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:56:55,148 INFO L93 Difference]: Finished difference Result 624 states and 699 transitions. [2018-04-12 04:56:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-12 04:56:55,148 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 3318 [2018-04-12 04:56:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:56:55,151 INFO L225 Difference]: With dead ends: 624 [2018-04-12 04:56:55,151 INFO L226 Difference]: Without dead ends: 624 [2018-04-12 04:56:55,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 04:56:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-04-12 04:56:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 619. [2018-04-12 04:56:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-04-12 04:56:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 693 transitions. [2018-04-12 04:56:55,155 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 693 transitions. Word has length 3318 [2018-04-12 04:56:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:56:55,156 INFO L459 AbstractCegarLoop]: Abstraction has 619 states and 693 transitions. [2018-04-12 04:56:55,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-12 04:56:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 693 transitions. [2018-04-12 04:56:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3366 [2018-04-12 04:56:55,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:56:55,195 INFO L355 BasicCegarLoop]: trace histogram [213, 213, 141, 141, 141, 141, 141, 141, 141, 141, 141, 73, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:56:55,196 INFO L408 AbstractCegarLoop]: === Iteration 93 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:56:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash -872405901, now seen corresponding path program 70 times [2018-04-12 04:56:55,196 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:56:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:56:55,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:57:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 213080 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 195044 trivial. 0 not checked. [2018-04-12 04:57:27,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:57:27,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-12 04:57:27,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:57:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 96600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96600 trivial. 0 not checked. [2018-04-12 04:57:27,298 INFO L182 omatonBuilderFactory]: Interpolants [61321#true, 61322#false, 61323#(= main_~i~2 0), 61324#(<= main_~i~2 1), 61325#(<= main_~i~2 2), 61326#(<= main_~i~2 3), 61327#(<= main_~i~2 4), 61328#(<= main_~i~2 5), 61329#(<= main_~i~2 6), 61330#(<= main_~i~2 7), 61331#(<= main_~i~2 8), 61332#(<= main_~i~2 9), 61333#(<= main_~i~2 10), 61334#(<= main_~i~2 11), 61335#(<= main_~i~2 12), 61336#(<= main_~i~2 13), 61337#(<= main_~i~2 14), 61338#(<= main_~i~2 15), 61339#(<= main_~i~2 16), 61340#(<= main_~i~2 17), 61341#(<= main_~i~2 18), 61342#(<= main_~i~2 19), 61343#(<= main_~i~2 20), 61344#(<= main_~i~2 21), 61345#(<= main_~i~2 22), 61346#(<= main_~i~2 23), 61347#(<= main_~i~2 24), 61348#(<= main_~i~2 25), 61349#(<= main_~i~2 26), 61350#(<= main_~i~2 27), 61351#(<= main_~i~2 28), 61352#(<= main_~i~2 29), 61353#(<= main_~i~2 30), 61354#(<= main_~i~2 31), 61355#(<= main_~i~2 32), 61356#(<= main_~i~2 33), 61357#(<= main_~i~2 34), 61358#(<= main_~i~2 35), 61359#(<= main_~i~2 36), 61360#(<= main_~i~2 37), 61361#(<= main_~i~2 38), 61362#(<= main_~i~2 39), 61363#(<= main_~i~2 40), 61364#(<= main_~i~2 41), 61365#(<= main_~i~2 42), 61366#(<= main_~i~2 43), 61367#(<= main_~i~2 44), 61368#(<= main_~i~2 45), 61369#(<= main_~i~2 46), 61370#(<= main_~i~2 47), 61371#(<= main_~i~2 48), 61372#(<= main_~i~2 49), 61373#(<= main_~i~2 50), 61374#(<= main_~i~2 51), 61375#(<= main_~i~2 52), 61376#(<= main_~i~2 53), 61377#(<= main_~i~2 54), 61378#(<= main_~i~2 55), 61379#(<= main_~i~2 56), 61380#(<= main_~i~2 57), 61381#(<= main_~i~2 58), 61382#(<= main_~i~2 59), 61383#(<= main_~i~2 60), 61384#(<= main_~i~2 61), 61385#(<= main_~i~2 62), 61386#(<= main_~i~2 63), 61387#(<= main_~i~2 64), 61388#(<= main_~i~2 65), 61389#(<= main_~i~2 66), 61390#(<= main_~i~2 67), 61391#(<= main_~i~2 68), 61392#(<= main_~i~2 69), 61393#(<= main_~i~2 70), 61394#(<= main_~i~2 71), 61395#(<= main_~i~2 72)] [2018-04-12 04:57:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 213080 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 195044 trivial. 0 not checked. [2018-04-12 04:57:27,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-12 04:57:27,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-12 04:57:27,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-12 04:57:27,301 INFO L87 Difference]: Start difference. First operand 619 states and 693 transitions. Second operand 75 states. [2018-04-12 04:57:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:57:28,277 INFO L93 Difference]: Finished difference Result 631 states and 707 transitions. [2018-04-12 04:57:28,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-12 04:57:28,278 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 3365 [2018-04-12 04:57:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:57:28,280 INFO L225 Difference]: With dead ends: 631 [2018-04-12 04:57:28,280 INFO L226 Difference]: Without dead ends: 631 [2018-04-12 04:57:28,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-12 04:57:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-04-12 04:57:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 626. [2018-04-12 04:57:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-04-12 04:57:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 701 transitions. [2018-04-12 04:57:28,286 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 701 transitions. Word has length 3365 [2018-04-12 04:57:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:57:28,287 INFO L459 AbstractCegarLoop]: Abstraction has 626 states and 701 transitions. [2018-04-12 04:57:28,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-12 04:57:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 701 transitions. [2018-04-12 04:57:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3413 [2018-04-12 04:57:28,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:57:28,327 INFO L355 BasicCegarLoop]: trace histogram [216, 216, 143, 143, 143, 143, 143, 143, 143, 143, 143, 74, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:57:28,327 INFO L408 AbstractCegarLoop]: === Iteration 94 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:57:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2122602355, now seen corresponding path program 71 times [2018-04-12 04:57:28,327 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:57:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:57:28,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:58:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 219141 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 200599 trivial. 0 not checked. [2018-04-12 04:58:01,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:58:01,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-12 04:58:01,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:58:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 99400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99400 trivial. 0 not checked. [2018-04-12 04:58:01,801 INFO L182 omatonBuilderFactory]: Interpolants [62720#(<= main_~i~2 65), 62721#(<= main_~i~2 66), 62722#(<= main_~i~2 67), 62723#(<= main_~i~2 68), 62724#(<= main_~i~2 69), 62725#(<= main_~i~2 70), 62726#(<= main_~i~2 71), 62727#(<= main_~i~2 72), 62728#(<= main_~i~2 73), 62653#true, 62654#false, 62655#(= main_~i~2 0), 62656#(<= main_~i~2 1), 62657#(<= main_~i~2 2), 62658#(<= main_~i~2 3), 62659#(<= main_~i~2 4), 62660#(<= main_~i~2 5), 62661#(<= main_~i~2 6), 62662#(<= main_~i~2 7), 62663#(<= main_~i~2 8), 62664#(<= main_~i~2 9), 62665#(<= main_~i~2 10), 62666#(<= main_~i~2 11), 62667#(<= main_~i~2 12), 62668#(<= main_~i~2 13), 62669#(<= main_~i~2 14), 62670#(<= main_~i~2 15), 62671#(<= main_~i~2 16), 62672#(<= main_~i~2 17), 62673#(<= main_~i~2 18), 62674#(<= main_~i~2 19), 62675#(<= main_~i~2 20), 62676#(<= main_~i~2 21), 62677#(<= main_~i~2 22), 62678#(<= main_~i~2 23), 62679#(<= main_~i~2 24), 62680#(<= main_~i~2 25), 62681#(<= main_~i~2 26), 62682#(<= main_~i~2 27), 62683#(<= main_~i~2 28), 62684#(<= main_~i~2 29), 62685#(<= main_~i~2 30), 62686#(<= main_~i~2 31), 62687#(<= main_~i~2 32), 62688#(<= main_~i~2 33), 62689#(<= main_~i~2 34), 62690#(<= main_~i~2 35), 62691#(<= main_~i~2 36), 62692#(<= main_~i~2 37), 62693#(<= main_~i~2 38), 62694#(<= main_~i~2 39), 62695#(<= main_~i~2 40), 62696#(<= main_~i~2 41), 62697#(<= main_~i~2 42), 62698#(<= main_~i~2 43), 62699#(<= main_~i~2 44), 62700#(<= main_~i~2 45), 62701#(<= main_~i~2 46), 62702#(<= main_~i~2 47), 62703#(<= main_~i~2 48), 62704#(<= main_~i~2 49), 62705#(<= main_~i~2 50), 62706#(<= main_~i~2 51), 62707#(<= main_~i~2 52), 62708#(<= main_~i~2 53), 62709#(<= main_~i~2 54), 62710#(<= main_~i~2 55), 62711#(<= main_~i~2 56), 62712#(<= main_~i~2 57), 62713#(<= main_~i~2 58), 62714#(<= main_~i~2 59), 62715#(<= main_~i~2 60), 62716#(<= main_~i~2 61), 62717#(<= main_~i~2 62), 62718#(<= main_~i~2 63), 62719#(<= main_~i~2 64)] [2018-04-12 04:58:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 219141 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 200599 trivial. 0 not checked. [2018-04-12 04:58:01,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-12 04:58:01,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-12 04:58:01,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 04:58:01,805 INFO L87 Difference]: Start difference. First operand 626 states and 701 transitions. Second operand 76 states. [2018-04-12 04:58:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:58:02,730 INFO L93 Difference]: Finished difference Result 638 states and 715 transitions. [2018-04-12 04:58:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-12 04:58:02,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 3412 [2018-04-12 04:58:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:58:02,733 INFO L225 Difference]: With dead ends: 638 [2018-04-12 04:58:02,733 INFO L226 Difference]: Without dead ends: 638 [2018-04-12 04:58:02,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 04:58:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-12 04:58:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 633. [2018-04-12 04:58:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-12 04:58:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 709 transitions. [2018-04-12 04:58:02,740 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 709 transitions. Word has length 3412 [2018-04-12 04:58:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:58:02,742 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 709 transitions. [2018-04-12 04:58:02,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-12 04:58:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 709 transitions. [2018-04-12 04:58:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3460 [2018-04-12 04:58:02,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:58:02,786 INFO L355 BasicCegarLoop]: trace histogram [219, 219, 145, 145, 145, 145, 145, 145, 145, 145, 145, 75, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:58:02,786 INFO L408 AbstractCegarLoop]: === Iteration 95 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:58:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1286346035, now seen corresponding path program 72 times [2018-04-12 04:58:02,786 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:58:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:58:03,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:58:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 225287 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 206232 trivial. 0 not checked. [2018-04-12 04:58:37,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:58:37,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-12 04:58:37,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:58:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 102240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102240 trivial. 0 not checked. [2018-04-12 04:58:37,524 INFO L182 omatonBuilderFactory]: Interpolants [64000#true, 64001#false, 64002#(= main_~i~2 0), 64003#(<= main_~i~2 1), 64004#(<= main_~i~2 2), 64005#(<= main_~i~2 3), 64006#(<= main_~i~2 4), 64007#(<= main_~i~2 5), 64008#(<= main_~i~2 6), 64009#(<= main_~i~2 7), 64010#(<= main_~i~2 8), 64011#(<= main_~i~2 9), 64012#(<= main_~i~2 10), 64013#(<= main_~i~2 11), 64014#(<= main_~i~2 12), 64015#(<= main_~i~2 13), 64016#(<= main_~i~2 14), 64017#(<= main_~i~2 15), 64018#(<= main_~i~2 16), 64019#(<= main_~i~2 17), 64020#(<= main_~i~2 18), 64021#(<= main_~i~2 19), 64022#(<= main_~i~2 20), 64023#(<= main_~i~2 21), 64024#(<= main_~i~2 22), 64025#(<= main_~i~2 23), 64026#(<= main_~i~2 24), 64027#(<= main_~i~2 25), 64028#(<= main_~i~2 26), 64029#(<= main_~i~2 27), 64030#(<= main_~i~2 28), 64031#(<= main_~i~2 29), 64032#(<= main_~i~2 30), 64033#(<= main_~i~2 31), 64034#(<= main_~i~2 32), 64035#(<= main_~i~2 33), 64036#(<= main_~i~2 34), 64037#(<= main_~i~2 35), 64038#(<= main_~i~2 36), 64039#(<= main_~i~2 37), 64040#(<= main_~i~2 38), 64041#(<= main_~i~2 39), 64042#(<= main_~i~2 40), 64043#(<= main_~i~2 41), 64044#(<= main_~i~2 42), 64045#(<= main_~i~2 43), 64046#(<= main_~i~2 44), 64047#(<= main_~i~2 45), 64048#(<= main_~i~2 46), 64049#(<= main_~i~2 47), 64050#(<= main_~i~2 48), 64051#(<= main_~i~2 49), 64052#(<= main_~i~2 50), 64053#(<= main_~i~2 51), 64054#(<= main_~i~2 52), 64055#(<= main_~i~2 53), 64056#(<= main_~i~2 54), 64057#(<= main_~i~2 55), 64058#(<= main_~i~2 56), 64059#(<= main_~i~2 57), 64060#(<= main_~i~2 58), 64061#(<= main_~i~2 59), 64062#(<= main_~i~2 60), 64063#(<= main_~i~2 61), 64064#(<= main_~i~2 62), 64065#(<= main_~i~2 63), 64066#(<= main_~i~2 64), 64067#(<= main_~i~2 65), 64068#(<= main_~i~2 66), 64069#(<= main_~i~2 67), 64070#(<= main_~i~2 68), 64071#(<= main_~i~2 69), 64072#(<= main_~i~2 70), 64073#(<= main_~i~2 71), 64074#(<= main_~i~2 72), 64075#(<= main_~i~2 73), 64076#(<= main_~i~2 74)] [2018-04-12 04:58:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 225287 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 206232 trivial. 0 not checked. [2018-04-12 04:58:37,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-12 04:58:37,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-12 04:58:37,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-12 04:58:37,527 INFO L87 Difference]: Start difference. First operand 633 states and 709 transitions. Second operand 77 states. [2018-04-12 04:58:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:58:38,565 INFO L93 Difference]: Finished difference Result 645 states and 723 transitions. [2018-04-12 04:58:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-12 04:58:38,565 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 3459 [2018-04-12 04:58:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:58:38,568 INFO L225 Difference]: With dead ends: 645 [2018-04-12 04:58:38,569 INFO L226 Difference]: Without dead ends: 645 [2018-04-12 04:58:38,569 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-12 04:58:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-04-12 04:58:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 640. [2018-04-12 04:58:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-04-12 04:58:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 717 transitions. [2018-04-12 04:58:38,575 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 717 transitions. Word has length 3459 [2018-04-12 04:58:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:58:38,576 INFO L459 AbstractCegarLoop]: Abstraction has 640 states and 717 transitions. [2018-04-12 04:58:38,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-12 04:58:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 717 transitions. [2018-04-12 04:58:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3507 [2018-04-12 04:58:38,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:58:38,620 INFO L355 BasicCegarLoop]: trace histogram [222, 222, 147, 147, 147, 147, 147, 147, 147, 147, 147, 76, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:58:38,620 INFO L408 AbstractCegarLoop]: === Iteration 96 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:58:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1898651597, now seen corresponding path program 73 times [2018-04-12 04:58:38,620 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:58:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:58:38,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 04:59:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 231518 backedges. 0 proven. 19575 refuted. 0 times theorem prover too weak. 211943 trivial. 0 not checked. [2018-04-12 04:59:15,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 04:59:15,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-12 04:59:15,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 04:59:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 105120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105120 trivial. 0 not checked. [2018-04-12 04:59:15,456 INFO L182 omatonBuilderFactory]: Interpolants [65408#(<= main_~i~2 44), 65409#(<= main_~i~2 45), 65410#(<= main_~i~2 46), 65411#(<= main_~i~2 47), 65412#(<= main_~i~2 48), 65413#(<= main_~i~2 49), 65414#(<= main_~i~2 50), 65415#(<= main_~i~2 51), 65416#(<= main_~i~2 52), 65417#(<= main_~i~2 53), 65418#(<= main_~i~2 54), 65419#(<= main_~i~2 55), 65420#(<= main_~i~2 56), 65421#(<= main_~i~2 57), 65422#(<= main_~i~2 58), 65423#(<= main_~i~2 59), 65424#(<= main_~i~2 60), 65425#(<= main_~i~2 61), 65426#(<= main_~i~2 62), 65427#(<= main_~i~2 63), 65428#(<= main_~i~2 64), 65429#(<= main_~i~2 65), 65430#(<= main_~i~2 66), 65431#(<= main_~i~2 67), 65432#(<= main_~i~2 68), 65433#(<= main_~i~2 69), 65434#(<= main_~i~2 70), 65435#(<= main_~i~2 71), 65436#(<= main_~i~2 72), 65437#(<= main_~i~2 73), 65438#(<= main_~i~2 74), 65439#(<= main_~i~2 75), 65362#true, 65363#false, 65364#(= main_~i~2 0), 65365#(<= main_~i~2 1), 65366#(<= main_~i~2 2), 65367#(<= main_~i~2 3), 65368#(<= main_~i~2 4), 65369#(<= main_~i~2 5), 65370#(<= main_~i~2 6), 65371#(<= main_~i~2 7), 65372#(<= main_~i~2 8), 65373#(<= main_~i~2 9), 65374#(<= main_~i~2 10), 65375#(<= main_~i~2 11), 65376#(<= main_~i~2 12), 65377#(<= main_~i~2 13), 65378#(<= main_~i~2 14), 65379#(<= main_~i~2 15), 65380#(<= main_~i~2 16), 65381#(<= main_~i~2 17), 65382#(<= main_~i~2 18), 65383#(<= main_~i~2 19), 65384#(<= main_~i~2 20), 65385#(<= main_~i~2 21), 65386#(<= main_~i~2 22), 65387#(<= main_~i~2 23), 65388#(<= main_~i~2 24), 65389#(<= main_~i~2 25), 65390#(<= main_~i~2 26), 65391#(<= main_~i~2 27), 65392#(<= main_~i~2 28), 65393#(<= main_~i~2 29), 65394#(<= main_~i~2 30), 65395#(<= main_~i~2 31), 65396#(<= main_~i~2 32), 65397#(<= main_~i~2 33), 65398#(<= main_~i~2 34), 65399#(<= main_~i~2 35), 65400#(<= main_~i~2 36), 65401#(<= main_~i~2 37), 65402#(<= main_~i~2 38), 65403#(<= main_~i~2 39), 65404#(<= main_~i~2 40), 65405#(<= main_~i~2 41), 65406#(<= main_~i~2 42), 65407#(<= main_~i~2 43)] [2018-04-12 04:59:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 231518 backedges. 0 proven. 19575 refuted. 0 times theorem prover too weak. 211943 trivial. 0 not checked. [2018-04-12 04:59:15,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-12 04:59:15,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-12 04:59:15,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 04:59:15,459 INFO L87 Difference]: Start difference. First operand 640 states and 717 transitions. Second operand 78 states. [2018-04-12 04:59:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 04:59:16,095 INFO L93 Difference]: Finished difference Result 652 states and 731 transitions. [2018-04-12 04:59:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-12 04:59:16,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 3506 [2018-04-12 04:59:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 04:59:16,098 INFO L225 Difference]: With dead ends: 652 [2018-04-12 04:59:16,098 INFO L226 Difference]: Without dead ends: 652 [2018-04-12 04:59:16,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 04:59:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-12 04:59:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 647. [2018-04-12 04:59:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-04-12 04:59:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 725 transitions. [2018-04-12 04:59:16,106 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 725 transitions. Word has length 3506 [2018-04-12 04:59:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 04:59:16,107 INFO L459 AbstractCegarLoop]: Abstraction has 647 states and 725 transitions. [2018-04-12 04:59:16,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-12 04:59:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 725 transitions. [2018-04-12 04:59:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3554 [2018-04-12 04:59:16,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 04:59:16,151 INFO L355 BasicCegarLoop]: trace histogram [225, 225, 149, 149, 149, 149, 149, 149, 149, 149, 149, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 04:59:16,151 INFO L408 AbstractCegarLoop]: === Iteration 97 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 04:59:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash -922470925, now seen corresponding path program 74 times [2018-04-12 04:59:16,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 04:59:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 04:59:16,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-12 04:59:38,875 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.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-12 04:59:38,878 INFO L168 Benchmark]: Toolchain (without parser) took 799568.12 ms. Allocated memory was 477.6 MB in the beginning and 3.2 GB in the end (delta: 2.7 GB). Free memory was 419.4 MB in the beginning and 921.4 MB in the end (delta: -502.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 5.3 GB. [2018-04-12 04:59:38,879 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 477.6 MB. Free memory is still 444.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 04:59:38,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.67 ms. Allocated memory is still 477.6 MB. Free memory was 419.4 MB in the beginning and 408.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-12 04:59:38,879 INFO L168 Benchmark]: Boogie Preprocessor took 26.12 ms. Allocated memory is still 477.6 MB. Free memory was 408.8 MB in the beginning and 407.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-12 04:59:38,879 INFO L168 Benchmark]: RCFGBuilder took 299.68 ms. Allocated memory was 477.6 MB in the beginning and 591.9 MB in the end (delta: 114.3 MB). Free memory was 407.4 MB in the beginning and 547.6 MB in the end (delta: -140.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 5.3 GB. [2018-04-12 04:59:38,880 INFO L168 Benchmark]: TraceAbstraction took 799073.28 ms. Allocated memory was 591.9 MB in the beginning and 3.2 GB in the end (delta: 2.6 GB). Free memory was 547.6 MB in the beginning and 921.4 MB in the end (delta: -373.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 5.3 GB. [2018-04-12 04:59:38,881 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.18 ms. Allocated memory is still 477.6 MB. Free memory is still 444.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.67 ms. Allocated memory is still 477.6 MB. Free memory was 419.4 MB in the beginning and 408.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.12 ms. Allocated memory is still 477.6 MB. Free memory was 408.8 MB in the beginning and 407.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 299.68 ms. Allocated memory was 477.6 MB in the beginning and 591.9 MB in the end (delta: 114.3 MB). Free memory was 407.4 MB in the beginning and 547.6 MB in the end (delta: -140.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 799073.28 ms. Allocated memory was 591.9 MB in the beginning and 3.2 GB in the end (delta: 2.6 GB). Free memory was 547.6 MB in the beginning and 921.4 MB in the end (delta: -373.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_04-59-38-888.csv Completed graceful shutdown