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-408c70d-m [2018-04-12 23:58:32,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 23:58:32,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 23:58:32,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 23:58:32,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 23:58:32,058 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 23:58:32,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 23:58:32,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 23:58:32,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 23:58:32,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 23:58:32,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 23:58:32,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 23:58:32,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 23:58:32,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 23:58:32,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 23:58:32,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 23:58:32,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 23:58:32,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 23:58:32,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 23:58:32,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 23:58:32,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 23:58:32,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 23:58:32,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 23:58:32,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 23:58:32,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 23:58:32,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 23:58:32,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 23:58:32,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 23:58:32,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 23:58:32,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 23:58:32,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 23:58:32,078 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-12 23:58:32,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 23:58:32,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 23:58:32,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 23:58:32,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 23:58:32,090 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 23:58:32,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 23:58:32,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 23:58:32,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 23:58:32,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 23:58:32,091 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 23:58:32,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 23:58:32,091 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 23:58:32,091 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 23:58:32,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 23:58:32,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 23:58:32,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 23:58:32,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 23:58:32,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 23:58:32,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 23:58:32,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 23:58:32,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 23:58:32,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 23:58:32,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 23:58:32,133 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 23:58:32,136 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 23:58:32,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 23:58:32,137 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 23:58:32,138 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 23:58:32,502 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG05a1bb9b4 [2018-04-12 23:58:32,586 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 23:58:32,586 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 23:58:32,586 INFO L168 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 23:58:32,587 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 23:58:32,587 INFO L215 ultiparseSymbolTable]: [2018-04-12 23:58:32,587 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 23:58:32,588 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 23:58:32,588 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 23:58:32,588 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 23:58:32,588 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 23:58:32,588 INFO L233 ultiparseSymbolTable]: [2018-04-12 23:58:32,600 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG05a1bb9b4 [2018-04-12 23:58:32,603 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 23:58:32,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 23:58:32,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 23:58:32,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 23:58:32,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 23:58:32,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5290150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32, skipping insertion in model container [2018-04-12 23:58:32,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,621 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 23:58:32,630 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 23:58:32,733 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 23:58:32,752 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 23:58:32,756 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-04-12 23:58:32,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32 WrapperNode [2018-04-12 23:58:32,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 23:58:32,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 23:58:32,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 23:58:32,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 23:58:32,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... [2018-04-12 23:58:32,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 23:58:32,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 23:58:32,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 23:58:32,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 23:58:32,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 23:58:32,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 23:58:32,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 23:58:32,830 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-12 23:58:32,830 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-12 23:58:32,830 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 23:58:32,830 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 23:58:32,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 23:58:32,831 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 23:58:32,831 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 23:58:33,039 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 23:58:33,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:58:33 BoogieIcfgContainer [2018-04-12 23:58:33,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 23:58:33,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 23:58:33,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 23:58:33,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 23:58:33,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 11:58:32" (1/3) ... [2018-04-12 23:58:33,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f05178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:58:33, skipping insertion in model container [2018-04-12 23:58:33,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:58:32" (2/3) ... [2018-04-12 23:58:33,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f05178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:58:33, skipping insertion in model container [2018-04-12 23:58:33,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:58:33" (3/3) ... [2018-04-12 23:58:33,045 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-12 23:58:33,053 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 23:58:33,059 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-12 23:58:33,086 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 23:58:33,087 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 23:58:33,087 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 23:58:33,087 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 23:58:33,087 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 23:58:33,087 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 23:58:33,088 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 23:58:33,088 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 23:58:33,088 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 23:58:33,089 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 23:58:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-04-12 23:58:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 23:58:33,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,109 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:58:33,109 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 23:58:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-04-12 23:58:33,144 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,169 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,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 23:58:33,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 23:58:33,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,189 INFO L182 omatonBuilderFactory]: Interpolants [71#true, 72#false] [2018-04-12 23:58:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-12 23:58:33,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-12 23:58:33,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-12 23:58:33,201 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-04-12 23:58:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,215 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-12 23:58:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-12 23:58:33,216 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-12 23:58:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,222 INFO L225 Difference]: With dead ends: 68 [2018-04-12 23:58:33,222 INFO L226 Difference]: Without dead ends: 65 [2018-04-12 23:58:33,223 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 23:58:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-12 23:58:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-12 23:58:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-12 23:58:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-12 23:58:33,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-04-12 23:58:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,247 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-12 23:58:33,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-12 23:58:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-12 23:58:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 23:58:33,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,247 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:58:33,247 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 23:58:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-04-12 23:58:33,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,259 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:58:33,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,284 INFO L182 omatonBuilderFactory]: Interpolants [208#(= main_~i~2 0), 206#true, 207#false] [2018-04-12 23:58:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 23:58:33,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 23:58:33,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:58:33,285 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-04-12 23:58:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,324 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-12 23:58:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 23:58:33,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-12 23:58:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,326 INFO L225 Difference]: With dead ends: 71 [2018-04-12 23:58:33,326 INFO L226 Difference]: Without dead ends: 71 [2018-04-12 23:58:33,327 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 23:58:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-12 23:58:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-04-12 23:58:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-12 23:58:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-12 23:58:33,333 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-04-12 23:58:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,333 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-12 23:58:33,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 23:58:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-12 23:58:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 23:58:33,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,334 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:58:33,334 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 23:58:33,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-04-12 23:58:33,335 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,347 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 23:58:33,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,410 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 23:58:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:58:33,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:58:33,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:58:33,410 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-04-12 23:58:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,502 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-12 23:58:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:58:33,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-12 23:58:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,504 INFO L225 Difference]: With dead ends: 85 [2018-04-12 23:58:33,504 INFO L226 Difference]: Without dead ends: 85 [2018-04-12 23:58:33,504 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 23:58:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-12 23:58:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-04-12 23:58:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-12 23:58:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-12 23:58:33,509 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-04-12 23:58:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,509 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-12 23:58:33,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:58:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-12 23:58:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 23:58:33,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,510 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 23:58:33,510 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 23:58:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-04-12 23:58:33,510 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,521 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 23:58:33,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,553 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 23:58:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:58:33,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:58:33,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:58:33,554 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-04-12 23:58:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,599 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-04-12 23:58:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:58:33,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-12 23:58:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,601 INFO L225 Difference]: With dead ends: 77 [2018-04-12 23:58:33,601 INFO L226 Difference]: Without dead ends: 77 [2018-04-12 23:58:33,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:58:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-12 23:58:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-12 23:58:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-12 23:58:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-12 23:58:33,606 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-04-12 23:58:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,607 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-12 23:58:33,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:58:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-12 23:58:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 23:58:33,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,608 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 23:58:33,608 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 23:58:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-04-12 23:58:33,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,619 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 23:58:33,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,657 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 23:58:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:58:33,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:58:33,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:58:33,658 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-04-12 23:58:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,728 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-12 23:58:33,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 23:58:33,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-12 23:58:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,729 INFO L225 Difference]: With dead ends: 89 [2018-04-12 23:58:33,729 INFO L226 Difference]: Without dead ends: 89 [2018-04-12 23:58:33,730 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 23:58:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-12 23:58:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-04-12 23:58:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-12 23:58:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-12 23:58:33,734 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-12 23:58:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,734 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-12 23:58:33,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:58:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-12 23:58:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 23:58:33,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,735 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 23:58:33,735 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 23:58:33,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-04-12 23:58:33,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,746 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 23:58:33,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,771 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 23:58:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:58:33,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:58:33,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:58:33,772 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-04-12 23:58:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,791 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-12 23:58:33,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:58:33,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-12 23:58:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,793 INFO L225 Difference]: With dead ends: 91 [2018-04-12 23:58:33,793 INFO L226 Difference]: Without dead ends: 91 [2018-04-12 23:58:33,793 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 23:58:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-12 23:58:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-04-12 23:58:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-12 23:58:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-12 23:58:33,798 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-04-12 23:58:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,798 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-12 23:58:33,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:58:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-12 23:58:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 23:58:33,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,799 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 23:58:33,800 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 23:58:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-04-12 23:58:33,800 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,813 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:33,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 23:58:33,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,870 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 23:58:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:33,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:58:33,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:58:33,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:58:33,871 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-04-12 23:58:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:33,959 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-04-12 23:58:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:58:33,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-12 23:58:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:33,960 INFO L225 Difference]: With dead ends: 86 [2018-04-12 23:58:33,960 INFO L226 Difference]: Without dead ends: 86 [2018-04-12 23:58:33,961 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 23:58:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-12 23:58:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-12 23:58:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-12 23:58:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-12 23:58:33,973 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-04-12 23:58:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:33,973 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-12 23:58:33,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:58:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-12 23:58:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 23:58:33,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:33,974 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 23:58:33,974 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 23:58:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-04-12 23:58:33,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:33,985 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:34,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:34,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 23:58:34,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:34,069 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 23:58:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:34,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 23:58:34,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 23:58:34,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 23:58:34,069 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-04-12 23:58:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:34,273 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-04-12 23:58:34,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 23:58:34,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-12 23:58:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:34,274 INFO L225 Difference]: With dead ends: 101 [2018-04-12 23:58:34,274 INFO L226 Difference]: Without dead ends: 101 [2018-04-12 23:58:34,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:58:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-12 23:58:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-04-12 23:58:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-12 23:58:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-04-12 23:58:34,280 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-04-12 23:58:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:34,280 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-04-12 23:58:34,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 23:58:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-04-12 23:58:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 23:58:34,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:34,282 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 23:58:34,282 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 23:58:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-04-12 23:58:34,283 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:34,294 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:34,332 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 23:58:34,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:34,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 23:58:34,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:34,333 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 23:58:34,333 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 23:58:34,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:58:34,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:58:34,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:58:34,333 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-04-12 23:58:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:34,377 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-04-12 23:58:34,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:58:34,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-12 23:58:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:34,378 INFO L225 Difference]: With dead ends: 96 [2018-04-12 23:58:34,378 INFO L226 Difference]: Without dead ends: 96 [2018-04-12 23:58:34,379 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 23:58:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-12 23:58:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-12 23:58:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-12 23:58:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-04-12 23:58:34,383 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-04-12 23:58:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:34,383 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-04-12 23:58:34,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:58:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-04-12 23:58:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 23:58:34,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:34,384 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 23:58:34,384 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 23:58:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-04-12 23:58:34,385 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:34,398 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:34,543 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 23:58:34,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:34,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:58:34,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:34,544 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 23:58:34,544 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 23:58:34,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:58:34,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:58:34,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:58:34,544 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 11 states. [2018-04-12 23:58:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:34,735 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2018-04-12 23:58:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 23:58:34,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-12 23:58:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:34,736 INFO L225 Difference]: With dead ends: 129 [2018-04-12 23:58:34,736 INFO L226 Difference]: Without dead ends: 129 [2018-04-12 23:58:34,737 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 23:58:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-12 23:58:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2018-04-12 23:58:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-12 23:58:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-04-12 23:58:34,741 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 42 [2018-04-12 23:58:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:34,741 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-04-12 23:58:34,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:58:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-04-12 23:58:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 23:58:34,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:34,742 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 23:58:34,742 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 23:58:34,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-04-12 23:58:34,743 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:34,755 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:34,819 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 23:58:34,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:34,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 23:58:34,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:34,820 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 23:58:34,820 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 23:58:34,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 23:58:34,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 23:58:34,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-12 23:58:34,821 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 8 states. [2018-04-12 23:58:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:34,941 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-04-12 23:58:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:58:34,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-04-12 23:58:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:34,942 INFO L225 Difference]: With dead ends: 114 [2018-04-12 23:58:34,942 INFO L226 Difference]: Without dead ends: 114 [2018-04-12 23:58:34,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:58:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-12 23:58:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-04-12 23:58:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-12 23:58:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-04-12 23:58:34,946 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 43 [2018-04-12 23:58:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:34,947 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-04-12 23:58:34,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 23:58:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-04-12 23:58:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 23:58:34,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:34,948 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 23:58:34,950 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 23:58:34,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-04-12 23:58:34,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:34,960 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:35,001 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 23:58:35,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:35,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-12 23:58:35,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:35,002 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 23:58:35,002 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 23:58:35,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:58:35,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:58:35,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:58:35,002 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-04-12 23:58:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:35,060 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-04-12 23:58:35,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 23:58:35,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-12 23:58:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:35,061 INFO L225 Difference]: With dead ends: 127 [2018-04-12 23:58:35,061 INFO L226 Difference]: Without dead ends: 127 [2018-04-12 23:58:35,061 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 23:58:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-12 23:58:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-04-12 23:58:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 23:58:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-12 23:58:35,064 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 46 [2018-04-12 23:58:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:35,064 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-12 23:58:35,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:58:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-12 23:58:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 23:58:35,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:35,064 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 23:58:35,065 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 23:58:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-04-12 23:58:35,065 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:35,076 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:35,117 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 23:58:35,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:58:35,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 23:58:35,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:35,117 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 23:58:35,117 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 23:58:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:58:35,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:58:35,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:58:35,118 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 6 states. [2018-04-12 23:58:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:35,160 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-04-12 23:58:35,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:58:35,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-12 23:58:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:35,161 INFO L225 Difference]: With dead ends: 126 [2018-04-12 23:58:35,161 INFO L226 Difference]: Without dead ends: 126 [2018-04-12 23:58:35,161 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 23:58:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-12 23:58:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-04-12 23:58:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-12 23:58:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-04-12 23:58:35,165 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 52 [2018-04-12 23:58:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:35,165 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-04-12 23:58:35,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:58:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-04-12 23:58:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 23:58:35,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:35,166 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 23:58:35,166 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 23:58:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-04-12 23:58:35,167 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:35,177 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:35,250 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 23:58:35,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:35,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-12 23:58:35,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:35,250 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 23:58:35,251 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 23:58:35,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:58:35,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:58:35,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:58:35,251 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 11 states. [2018-04-12 23:58:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:35,413 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-04-12 23:58:35,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 23:58:35,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-04-12 23:58:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:35,414 INFO L225 Difference]: With dead ends: 138 [2018-04-12 23:58:35,414 INFO L226 Difference]: Without dead ends: 138 [2018-04-12 23:58:35,415 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 23:58:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-12 23:58:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-04-12 23:58:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 23:58:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-12 23:58:35,418 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-04-12 23:58:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:35,418 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-12 23:58:35,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:58:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-12 23:58:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 23:58:35,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:35,422 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 23:58:35,422 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 23:58:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-04-12 23:58:35,423 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:35,439 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:35,536 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 23:58:35,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:35,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 23:58:35,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:35,538 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 23:58:35,538 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 23:58:35,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 23:58:35,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 23:58:35,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 23:58:35,539 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 9 states. [2018-04-12 23:58:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:35,673 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-04-12 23:58:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 23:58:35,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-04-12 23:58:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:35,674 INFO L225 Difference]: With dead ends: 146 [2018-04-12 23:58:35,674 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 23:58:35,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-12 23:58:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 23:58:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-04-12 23:58:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 23:58:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-04-12 23:58:35,678 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-04-12 23:58:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:35,678 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-04-12 23:58:35,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 23:58:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-04-12 23:58:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 23:58:35,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:35,680 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 23:58:35,680 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 23:58:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-04-12 23:58:35,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:35,696 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:35,861 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 23:58:35,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:35,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 23:58:35,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:35,862 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 23:58:35,862 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 23:58:35,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 23:58:35,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 23:58:35,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-04-12 23:58:35,863 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 16 states. [2018-04-12 23:58:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:36,171 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-04-12 23:58:36,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 23:58:36,172 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-12 23:58:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:36,173 INFO L225 Difference]: With dead ends: 141 [2018-04-12 23:58:36,173 INFO L226 Difference]: Without dead ends: 141 [2018-04-12 23:58:36,174 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 23:58:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-12 23:58:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-04-12 23:58:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 23:58:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-04-12 23:58:36,178 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 67 [2018-04-12 23:58:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:36,178 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-04-12 23:58:36,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 23:58:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-04-12 23:58:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-12 23:58:36,181 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:36,181 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 23:58:36,181 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 23:58:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1765271438, now seen corresponding path program 1 times [2018-04-12 23:58:36,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:36,198 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:36,291 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 23:58:36,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:36,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:58:36,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:36,292 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 23:58:36,292 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 23:58:36,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:58:36,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:58:36,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:58:36,293 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 11 states. [2018-04-12 23:58:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:36,538 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-12 23:58:36,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 23:58:36,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-04-12 23:58:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:36,539 INFO L225 Difference]: With dead ends: 134 [2018-04-12 23:58:36,539 INFO L226 Difference]: Without dead ends: 134 [2018-04-12 23:58:36,540 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 23:58:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-12 23:58:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-04-12 23:58:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-12 23:58:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-12 23:58:36,542 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 78 [2018-04-12 23:58:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:36,543 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-12 23:58:36,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:58:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-12 23:58:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-12 23:58:36,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:36,544 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 23:58:36,544 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 23:58:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-04-12 23:58:36,544 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:36,554 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:36,575 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 23:58:36,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:36,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-12 23:58:36,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:36,576 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 23:58:36,576 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 23:58:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:58:36,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:58:36,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:58:36,576 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 5 states. [2018-04-12 23:58:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:36,605 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-04-12 23:58:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:58:36,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-04-12 23:58:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:36,607 INFO L225 Difference]: With dead ends: 136 [2018-04-12 23:58:36,607 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 23:58:36,607 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 23:58:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 23:58:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-04-12 23:58:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 23:58:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-12 23:58:36,610 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 80 [2018-04-12 23:58:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:36,610 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-12 23:58:36,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:58:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-12 23:58:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-12 23:58:36,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:36,611 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 23:58:36,611 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 23:58:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 2 times [2018-04-12 23:58:36,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:36,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:36,759 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 23:58:36,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:36,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:58:36,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:36,760 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 23:58:36,761 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 23:58:36,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 23:58:36,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 23:58:36,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-12 23:58:36,761 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 13 states. [2018-04-12 23:58:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:36,975 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-04-12 23:58:36,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 23:58:36,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-04-12 23:58:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:36,983 INFO L225 Difference]: With dead ends: 136 [2018-04-12 23:58:36,984 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 23:58:36,984 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 23:58:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 23:58:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-04-12 23:58:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 23:58:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-04-12 23:58:36,988 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 84 [2018-04-12 23:58:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:36,988 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-04-12 23:58:36,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 23:58:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-04-12 23:58:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-12 23:58:36,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:36,989 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 23:58:36,989 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 23:58:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1044060343, now seen corresponding path program 1 times [2018-04-12 23:58:36,990 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:37,004 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:37,101 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 23:58:37,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:37,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 23:58:37,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:37,102 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 23:58:37,102 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 23:58:37,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 23:58:37,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 23:58:37,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:58:37,102 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 10 states. [2018-04-12 23:58:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:37,210 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-04-12 23:58:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 23:58:37,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-04-12 23:58:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:37,211 INFO L225 Difference]: With dead ends: 129 [2018-04-12 23:58:37,211 INFO L226 Difference]: Without dead ends: 129 [2018-04-12 23:58:37,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-04-12 23:58:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-12 23:58:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-04-12 23:58:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-12 23:58:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-04-12 23:58:37,213 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 93 [2018-04-12 23:58:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:37,213 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-04-12 23:58:37,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 23:58:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-04-12 23:58:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-12 23:58:37,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:37,214 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 23:58:37,214 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 23:58:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1115175640, now seen corresponding path program 2 times [2018-04-12 23:58:37,214 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:37,226 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:37,337 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 23:58:37,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:37,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:58:37,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:37,338 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 23:58:37,338 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 23:58:37,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 23:58:37,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 23:58:37,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:58:37,339 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 12 states. [2018-04-12 23:58:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:37,605 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-12 23:58:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 23:58:37,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-04-12 23:58:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:37,607 INFO L225 Difference]: With dead ends: 164 [2018-04-12 23:58:37,607 INFO L226 Difference]: Without dead ends: 155 [2018-04-12 23:58:37,607 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 23:58:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-12 23:58:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2018-04-12 23:58:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-12 23:58:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-12 23:58:37,611 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 103 [2018-04-12 23:58:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:37,611 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-12 23:58:37,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 23:58:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-12 23:58:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-12 23:58:37,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:37,613 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 23:58:37,613 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 23:58:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash -260385982, now seen corresponding path program 3 times [2018-04-12 23:58:37,613 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:37,631 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:37,732 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 23:58:37,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:37,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:58:37,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:37,733 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 23:58:37,733 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 23:58:37,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 23:58:37,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 23:58:37,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:58:37,734 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 12 states. [2018-04-12 23:58:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:37,865 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-04-12 23:58:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 23:58:37,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-04-12 23:58:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:37,867 INFO L225 Difference]: With dead ends: 166 [2018-04-12 23:58:37,867 INFO L226 Difference]: Without dead ends: 140 [2018-04-12 23:58:37,867 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 23:58:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-12 23:58:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-04-12 23:58:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-12 23:58:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-04-12 23:58:37,870 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 109 [2018-04-12 23:58:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:37,871 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-04-12 23:58:37,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 23:58:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-04-12 23:58:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-12 23:58:37,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:37,872 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 23:58:37,872 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 23:58:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash -562399357, now seen corresponding path program 4 times [2018-04-12 23:58:37,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:37,890 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:38,160 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 23:58:38,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:38,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 23:58:38,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:38,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 23:58:38,160 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 23:58:38,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 23:58:38,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 23:58:38,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 23:58:38,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:58:38,161 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 21 states. [2018-04-12 23:58:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:38,439 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-04-12 23:58:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 23:58:38,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-12 23:58:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:38,440 INFO L225 Difference]: With dead ends: 136 [2018-04-12 23:58:38,440 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 23:58:38,441 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 23:58:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 23:58:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-04-12 23:58:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-12 23:58:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-04-12 23:58:38,444 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 114 [2018-04-12 23:58:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:38,444 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-04-12 23:58:38,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 23:58:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-04-12 23:58:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-12 23:58:38,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:38,445 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 23:58:38,445 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 23:58:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash -277595443, now seen corresponding path program 1 times [2018-04-12 23:58:38,446 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:38,461 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:38,496 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 23:58:38,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:38,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 23:58:38,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:58:38,498 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 23:58:38,498 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 23:58:38,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:58:38,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:58:38,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:58:38,499 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 6 states. [2018-04-12 23:58:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:38,528 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-04-12 23:58:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:58:38,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-04-12 23:58:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:38,530 INFO L225 Difference]: With dead ends: 148 [2018-04-12 23:58:38,530 INFO L226 Difference]: Without dead ends: 148 [2018-04-12 23:58:38,530 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 23:58:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-12 23:58:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-04-12 23:58:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-12 23:58:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-04-12 23:58:38,534 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 122 [2018-04-12 23:58:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:38,534 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-04-12 23:58:38,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:58:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-04-12 23:58:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-12 23:58:38,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:38,535 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 23:58:38,535 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 23:58:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 313375475, now seen corresponding path program 2 times [2018-04-12 23:58:38,536 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:38,554 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:38,626 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 23:58:38,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:38,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-12 23:58:38,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:38,627 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 23:58:38,627 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 23:58:38,627 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 23:58:38,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:58:38,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:58:38,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:58:38,628 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 7 states. [2018-04-12 23:58:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:38,663 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-04-12 23:58:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 23:58:38,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-04-12 23:58:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:38,665 INFO L225 Difference]: With dead ends: 155 [2018-04-12 23:58:38,665 INFO L226 Difference]: Without dead ends: 155 [2018-04-12 23:58:38,665 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 23:58:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-12 23:58:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-04-12 23:58:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 23:58:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-04-12 23:58:38,669 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 169 [2018-04-12 23:58:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:38,669 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-04-12 23:58:38,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:58:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-04-12 23:58:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-04-12 23:58:38,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:38,670 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 23:58:38,670 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 23:58:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2136490509, now seen corresponding path program 3 times [2018-04-12 23:58:38,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:38,695 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:38,762 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 23:58:38,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:38,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 23:58:38,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:38,763 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 23:58:38,763 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 23:58:38,764 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 23:58:38,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 23:58:38,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 23:58:38,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-12 23:58:38,764 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 8 states. [2018-04-12 23:58:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:38,808 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-04-12 23:58:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:58:38,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-04-12 23:58:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:38,809 INFO L225 Difference]: With dead ends: 162 [2018-04-12 23:58:38,809 INFO L226 Difference]: Without dead ends: 162 [2018-04-12 23:58:38,810 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 23:58:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-12 23:58:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2018-04-12 23:58:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-12 23:58:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-04-12 23:58:38,814 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 216 [2018-04-12 23:58:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:38,815 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-04-12 23:58:38,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 23:58:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-04-12 23:58:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-04-12 23:58:38,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:38,816 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 23:58:38,816 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 23:58:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash -882947149, now seen corresponding path program 4 times [2018-04-12 23:58:38,817 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:38,847 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:38,934 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 23:58:38,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:38,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 23:58:38,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:38,935 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 23:58:38,935 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 23:58:38,936 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 23:58:38,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 23:58:38,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 23:58:38,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-12 23:58:38,936 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 9 states. [2018-04-12 23:58:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:38,985 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-04-12 23:58:38,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 23:58:38,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2018-04-12 23:58:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:38,986 INFO L225 Difference]: With dead ends: 169 [2018-04-12 23:58:38,986 INFO L226 Difference]: Without dead ends: 169 [2018-04-12 23:58:38,987 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 23:58:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-12 23:58:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-04-12 23:58:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-12 23:58:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-12 23:58:38,990 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 263 [2018-04-12 23:58:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:38,991 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-12 23:58:38,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 23:58:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-12 23:58:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-12 23:58:38,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:38,993 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 23:58:38,993 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 23:58:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash 93198669, now seen corresponding path program 5 times [2018-04-12 23:58:38,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:39,025 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:39,170 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 23:58:39,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:39,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:58:39,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:39,171 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 23:58:39,171 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 23:58:39,172 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 23:58:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 23:58:39,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 23:58:39,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:58:39,172 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-04-12 23:58:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:39,250 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-04-12 23:58:39,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 23:58:39,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 310 [2018-04-12 23:58:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:39,252 INFO L225 Difference]: With dead ends: 176 [2018-04-12 23:58:39,252 INFO L226 Difference]: Without dead ends: 176 [2018-04-12 23:58:39,252 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 23:58:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-12 23:58:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-04-12 23:58:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-12 23:58:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-04-12 23:58:39,257 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 310 [2018-04-12 23:58:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:39,257 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-04-12 23:58:39,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 23:58:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-04-12 23:58:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-12 23:58:39,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:39,259 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 23:58:39,259 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 23:58:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1457189773, now seen corresponding path program 6 times [2018-04-12 23:58:39,260 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:39,297 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:39,442 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 23:58:39,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:39,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-12 23:58:39,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:39,443 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 23:58:39,443 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 23:58:39,444 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 23:58:39,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:58:39,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:58:39,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:58:39,445 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 11 states. [2018-04-12 23:58:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:39,512 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-04-12 23:58:39,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 23:58:39,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2018-04-12 23:58:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:39,514 INFO L225 Difference]: With dead ends: 183 [2018-04-12 23:58:39,514 INFO L226 Difference]: Without dead ends: 183 [2018-04-12 23:58:39,514 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 23:58:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-12 23:58:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-04-12 23:58:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-12 23:58:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2018-04-12 23:58:39,518 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 357 [2018-04-12 23:58:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:39,519 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2018-04-12 23:58:39,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:58:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2018-04-12 23:58:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-12 23:58:39,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:39,521 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 23:58:39,522 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 23:58:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1787412621, now seen corresponding path program 7 times [2018-04-12 23:58:39,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:39,563 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:39,760 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 23:58:39,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:39,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:58:39,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:39,762 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 23:58:39,762 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 23:58:39,763 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 23:58:39,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 23:58:39,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 23:58:39,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:58:39,764 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand 12 states. [2018-04-12 23:58:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:39,836 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-04-12 23:58:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 23:58:39,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 404 [2018-04-12 23:58:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:39,837 INFO L225 Difference]: With dead ends: 190 [2018-04-12 23:58:39,837 INFO L226 Difference]: Without dead ends: 190 [2018-04-12 23:58:39,838 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 23:58:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-12 23:58:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2018-04-12 23:58:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-12 23:58:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-04-12 23:58:39,842 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 404 [2018-04-12 23:58:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:39,842 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-04-12 23:58:39,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 23:58:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-04-12 23:58:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-04-12 23:58:39,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:39,845 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 23:58:39,846 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 23:58:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 487259443, now seen corresponding path program 8 times [2018-04-12 23:58:39,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:39,890 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:40,074 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 23:58:40,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:40,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 23:58:40,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:40,075 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 23:58:40,075 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 23:58:40,076 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 23:58:40,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 23:58:40,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 23:58:40,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-12 23:58:40,076 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 13 states. [2018-04-12 23:58:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:40,148 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-04-12 23:58:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 23:58:40,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 451 [2018-04-12 23:58:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:40,149 INFO L225 Difference]: With dead ends: 197 [2018-04-12 23:58:40,149 INFO L226 Difference]: Without dead ends: 197 [2018-04-12 23:58:40,150 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 23:58:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-12 23:58:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-04-12 23:58:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-12 23:58:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-04-12 23:58:40,152 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 451 [2018-04-12 23:58:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:40,153 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-04-12 23:58:40,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 23:58:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-04-12 23:58:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-04-12 23:58:40,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:40,155 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 23:58:40,155 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 23:58:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1279313971, now seen corresponding path program 9 times [2018-04-12 23:58:40,155 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:40,185 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:40,444 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 23:58:40,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:40,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 23:58:40,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:40,445 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 23:58:40,445 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 23:58:40,447 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 23:58:40,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 23:58:40,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 23:58:40,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-12 23:58:40,447 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 14 states. [2018-04-12 23:58:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:40,542 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-04-12 23:58:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 23:58:40,542 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 498 [2018-04-12 23:58:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:40,544 INFO L225 Difference]: With dead ends: 204 [2018-04-12 23:58:40,544 INFO L226 Difference]: Without dead ends: 204 [2018-04-12 23:58:40,544 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 23:58:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-12 23:58:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2018-04-12 23:58:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-12 23:58:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-04-12 23:58:40,549 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 498 [2018-04-12 23:58:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:40,550 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-04-12 23:58:40,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 23:58:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-04-12 23:58:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-04-12 23:58:40,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:40,554 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 23:58:40,554 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 23:58:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -618848781, now seen corresponding path program 10 times [2018-04-12 23:58:40,555 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:40,608 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:40,840 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 23:58:40,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:40,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 23:58:40,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:40,841 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 23:58:40,841 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 23:58:40,843 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 23:58:40,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 23:58:40,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 23:58:40,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-12 23:58:40,843 INFO L87 Difference]: Start difference. First operand 199 states and 213 transitions. Second operand 15 states. [2018-04-12 23:58:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:40,953 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-04-12 23:58:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 23:58:40,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 545 [2018-04-12 23:58:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:40,955 INFO L225 Difference]: With dead ends: 211 [2018-04-12 23:58:40,955 INFO L226 Difference]: Without dead ends: 211 [2018-04-12 23:58:40,955 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 23:58:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-12 23:58:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-04-12 23:58:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-12 23:58:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2018-04-12 23:58:40,959 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 545 [2018-04-12 23:58:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:40,960 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2018-04-12 23:58:40,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 23:58:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2018-04-12 23:58:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-12 23:58:40,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:40,962 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 23:58:40,963 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 23:58:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1134722829, now seen corresponding path program 11 times [2018-04-12 23:58:40,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:41,000 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:41,279 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 23:58:41,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:41,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 23:58:41,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:41,281 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 23:58:41,281 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 23:58:41,282 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 23:58:41,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 23:58:41,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 23:58:41,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-12 23:58:41,282 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand 16 states. [2018-04-12 23:58:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:41,414 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2018-04-12 23:58:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 23:58:41,415 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 592 [2018-04-12 23:58:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:41,416 INFO L225 Difference]: With dead ends: 218 [2018-04-12 23:58:41,416 INFO L226 Difference]: Without dead ends: 218 [2018-04-12 23:58:41,417 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 23:58:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-12 23:58:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-04-12 23:58:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 23:58:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 229 transitions. [2018-04-12 23:58:41,422 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 229 transitions. Word has length 592 [2018-04-12 23:58:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:41,423 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 229 transitions. [2018-04-12 23:58:41,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 23:58:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 229 transitions. [2018-04-12 23:58:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-04-12 23:58:41,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:41,427 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 23:58:41,427 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 23:58:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1704497485, now seen corresponding path program 12 times [2018-04-12 23:58:41,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:41,487 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:41,767 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 23:58:41,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:41,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 23:58:41,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:41,768 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 23:58:41,768 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 23:58:41,768 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 23:58:41,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 23:58:41,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 23:58:41,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-12 23:58:41,768 INFO L87 Difference]: Start difference. First operand 213 states and 229 transitions. Second operand 17 states. [2018-04-12 23:58:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:41,888 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2018-04-12 23:58:41,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 23:58:41,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 639 [2018-04-12 23:58:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:41,890 INFO L225 Difference]: With dead ends: 225 [2018-04-12 23:58:41,890 INFO L226 Difference]: Without dead ends: 225 [2018-04-12 23:58:41,891 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 23:58:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-12 23:58:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-04-12 23:58:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-12 23:58:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 237 transitions. [2018-04-12 23:58:41,896 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 237 transitions. Word has length 639 [2018-04-12 23:58:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:41,897 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 237 transitions. [2018-04-12 23:58:41,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 23:58:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 237 transitions. [2018-04-12 23:58:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2018-04-12 23:58:41,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:41,901 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 23:58:41,902 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 23:58:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash 430413389, now seen corresponding path program 13 times [2018-04-12 23:58:41,902 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:41,966 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:42,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 23:58:42,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:42,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 23:58:42,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:42,363 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 23:58:42,363 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 23:58:42,364 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 23:58:42,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 23:58:42,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 23:58:42,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-12 23:58:42,364 INFO L87 Difference]: Start difference. First operand 220 states and 237 transitions. Second operand 18 states. [2018-04-12 23:58:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:42,484 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2018-04-12 23:58:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 23:58:42,484 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 686 [2018-04-12 23:58:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:42,485 INFO L225 Difference]: With dead ends: 232 [2018-04-12 23:58:42,486 INFO L226 Difference]: Without dead ends: 232 [2018-04-12 23:58:42,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-12 23:58:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-12 23:58:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-04-12 23:58:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 23:58:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-04-12 23:58:42,490 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 686 [2018-04-12 23:58:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:42,491 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-04-12 23:58:42,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 23:58:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-04-12 23:58:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-04-12 23:58:42,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:42,496 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 23:58:42,496 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 23:58:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash -722079885, now seen corresponding path program 14 times [2018-04-12 23:58:42,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:42,563 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:43,046 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 23:58:43,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:43,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 23:58:43,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:43,047 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 23:58:43,047 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 23:58:43,048 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 23:58:43,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 23:58:43,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 23:58:43,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-12 23:58:43,049 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 19 states. [2018-04-12 23:58:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:43,171 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-04-12 23:58:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 23:58:43,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 733 [2018-04-12 23:58:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:43,172 INFO L225 Difference]: With dead ends: 239 [2018-04-12 23:58:43,173 INFO L226 Difference]: Without dead ends: 239 [2018-04-12 23:58:43,173 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 23:58:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-12 23:58:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 234. [2018-04-12 23:58:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-12 23:58:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 253 transitions. [2018-04-12 23:58:43,178 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 253 transitions. Word has length 733 [2018-04-12 23:58:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:43,178 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 253 transitions. [2018-04-12 23:58:43,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 23:58:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 253 transitions. [2018-04-12 23:58:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-04-12 23:58:43,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:43,184 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 23:58:43,184 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 23:58:43,184 INFO L82 PathProgramCache]: Analyzing trace with hash 306347405, now seen corresponding path program 15 times [2018-04-12 23:58:43,185 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:43,257 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:43,665 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 23:58:43,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:43,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 23:58:43,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:43,666 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 23:58:43,666 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 23:58:43,667 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 23:58:43,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 23:58:43,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 23:58:43,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-12 23:58:43,667 INFO L87 Difference]: Start difference. First operand 234 states and 253 transitions. Second operand 20 states. [2018-04-12 23:58:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:43,790 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2018-04-12 23:58:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 23:58:43,790 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 780 [2018-04-12 23:58:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:43,791 INFO L225 Difference]: With dead ends: 246 [2018-04-12 23:58:43,791 INFO L226 Difference]: Without dead ends: 246 [2018-04-12 23:58:43,791 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 23:58:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-12 23:58:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-04-12 23:58:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-12 23:58:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 261 transitions. [2018-04-12 23:58:43,794 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 261 transitions. Word has length 780 [2018-04-12 23:58:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:43,795 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 261 transitions. [2018-04-12 23:58:43,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 23:58:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 261 transitions. [2018-04-12 23:58:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-04-12 23:58:43,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:43,798 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 23:58:43,799 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 23:58:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2016108493, now seen corresponding path program 16 times [2018-04-12 23:58:43,799 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:43,843 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:44,219 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 23:58:44,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:44,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 23:58:44,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:44,220 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 23:58:44,220 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 23:58:44,220 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 23:58:44,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 23:58:44,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 23:58:44,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:58:44,221 INFO L87 Difference]: Start difference. First operand 241 states and 261 transitions. Second operand 21 states. [2018-04-12 23:58:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:44,333 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-04-12 23:58:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 23:58:44,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 827 [2018-04-12 23:58:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:44,334 INFO L225 Difference]: With dead ends: 253 [2018-04-12 23:58:44,334 INFO L226 Difference]: Without dead ends: 253 [2018-04-12 23:58:44,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:58:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-12 23:58:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2018-04-12 23:58:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-12 23:58:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 269 transitions. [2018-04-12 23:58:44,338 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 269 transitions. Word has length 827 [2018-04-12 23:58:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:44,338 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 269 transitions. [2018-04-12 23:58:44,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 23:58:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 269 transitions. [2018-04-12 23:58:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-12 23:58:44,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:44,342 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 23:58:44,342 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 23:58:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 652686541, now seen corresponding path program 17 times [2018-04-12 23:58:44,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:44,389 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:44,787 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 23:58:44,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:44,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 23:58:44,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:44,787 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 23:58:44,788 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 23:58:44,788 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 23:58:44,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 23:58:44,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 23:58:44,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-12 23:58:44,788 INFO L87 Difference]: Start difference. First operand 248 states and 269 transitions. Second operand 22 states. [2018-04-12 23:58:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:44,905 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-04-12 23:58:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 23:58:44,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 874 [2018-04-12 23:58:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:44,906 INFO L225 Difference]: With dead ends: 260 [2018-04-12 23:58:44,906 INFO L226 Difference]: Without dead ends: 260 [2018-04-12 23:58:44,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-12 23:58:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-12 23:58:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-04-12 23:58:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-12 23:58:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 277 transitions. [2018-04-12 23:58:44,912 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 277 transitions. Word has length 874 [2018-04-12 23:58:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:44,913 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 277 transitions. [2018-04-12 23:58:44,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 23:58:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 277 transitions. [2018-04-12 23:58:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2018-04-12 23:58:44,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:44,920 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 23:58:44,920 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 23:58:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash -217087757, now seen corresponding path program 18 times [2018-04-12 23:58:44,921 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:44,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:45,485 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 23:58:45,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:45,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 23:58:45,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:45,486 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 23:58:45,486 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 23:58:45,486 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 23:58:45,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 23:58:45,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 23:58:45,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-12 23:58:45,487 INFO L87 Difference]: Start difference. First operand 255 states and 277 transitions. Second operand 23 states. [2018-04-12 23:58:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:45,606 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-04-12 23:58:45,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 23:58:45,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 921 [2018-04-12 23:58:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:45,607 INFO L225 Difference]: With dead ends: 267 [2018-04-12 23:58:45,608 INFO L226 Difference]: Without dead ends: 267 [2018-04-12 23:58:45,608 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 23:58:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-12 23:58:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2018-04-12 23:58:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-12 23:58:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2018-04-12 23:58:45,612 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 921 [2018-04-12 23:58:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:45,613 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2018-04-12 23:58:45,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 23:58:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2018-04-12 23:58:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2018-04-12 23:58:45,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:45,620 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 23:58:45,620 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 23:58:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1375093747, now seen corresponding path program 19 times [2018-04-12 23:58:45,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:45,704 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:46,237 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 23:58:46,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:46,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 23:58:46,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:46,238 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 23:58:46,238 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 23:58:46,239 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 23:58:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 23:58:46,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 23:58:46,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-12 23:58:46,239 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand 24 states. [2018-04-12 23:58:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:46,366 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2018-04-12 23:58:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 23:58:46,366 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 968 [2018-04-12 23:58:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:46,367 INFO L225 Difference]: With dead ends: 274 [2018-04-12 23:58:46,367 INFO L226 Difference]: Without dead ends: 274 [2018-04-12 23:58:46,368 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 23:58:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-12 23:58:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2018-04-12 23:58:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-12 23:58:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 293 transitions. [2018-04-12 23:58:46,371 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 293 transitions. Word has length 968 [2018-04-12 23:58:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:46,371 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 293 transitions. [2018-04-12 23:58:46,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 23:58:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 293 transitions. [2018-04-12 23:58:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-04-12 23:58:46,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:46,376 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 23:58:46,376 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 23:58:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1504874931, now seen corresponding path program 20 times [2018-04-12 23:58:46,377 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:46,433 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:47,072 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 23:58:47,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:47,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 23:58:47,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:47,073 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 23:58:47,073 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 23:58:47,074 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 23:58:47,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 23:58:47,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 23:58:47,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-12 23:58:47,075 INFO L87 Difference]: Start difference. First operand 269 states and 293 transitions. Second operand 25 states. [2018-04-12 23:58:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:47,192 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2018-04-12 23:58:47,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 23:58:47,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1015 [2018-04-12 23:58:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:47,194 INFO L225 Difference]: With dead ends: 281 [2018-04-12 23:58:47,194 INFO L226 Difference]: Without dead ends: 281 [2018-04-12 23:58:47,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-12 23:58:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-12 23:58:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2018-04-12 23:58:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-12 23:58:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 301 transitions. [2018-04-12 23:58:47,198 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 301 transitions. Word has length 1015 [2018-04-12 23:58:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:47,199 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 301 transitions. [2018-04-12 23:58:47,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 23:58:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 301 transitions. [2018-04-12 23:58:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-04-12 23:58:47,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:47,204 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 23:58:47,204 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 23:58:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1692527795, now seen corresponding path program 21 times [2018-04-12 23:58:47,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:47,262 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:47,847 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 23:58:47,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:47,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 23:58:47,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:47,899 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 23:58:47,899 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 23:58:47,900 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 23:58:47,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 23:58:47,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 23:58:47,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-12 23:58:47,901 INFO L87 Difference]: Start difference. First operand 276 states and 301 transitions. Second operand 26 states. [2018-04-12 23:58:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:48,122 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2018-04-12 23:58:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 23:58:48,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1062 [2018-04-12 23:58:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:48,123 INFO L225 Difference]: With dead ends: 288 [2018-04-12 23:58:48,123 INFO L226 Difference]: Without dead ends: 288 [2018-04-12 23:58:48,124 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 23:58:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-12 23:58:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-04-12 23:58:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-12 23:58:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2018-04-12 23:58:48,128 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 1062 [2018-04-12 23:58:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:48,129 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2018-04-12 23:58:48,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 23:58:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2018-04-12 23:58:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-04-12 23:58:48,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:48,143 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 23:58:48,143 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 23:58:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1043737997, now seen corresponding path program 22 times [2018-04-12 23:58:48,144 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:48,238 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:48,916 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 23:58:48,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:48,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 23:58:48,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:48,917 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 23:58:48,917 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 23:58:48,918 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 23:58:48,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 23:58:48,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 23:58:48,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-12 23:58:48,918 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand 27 states. [2018-04-12 23:58:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:49,043 INFO L93 Difference]: Finished difference Result 295 states and 323 transitions. [2018-04-12 23:58:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 23:58:49,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1109 [2018-04-12 23:58:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:49,044 INFO L225 Difference]: With dead ends: 295 [2018-04-12 23:58:49,044 INFO L226 Difference]: Without dead ends: 295 [2018-04-12 23:58:49,044 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 23:58:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-12 23:58:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2018-04-12 23:58:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-12 23:58:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 317 transitions. [2018-04-12 23:58:49,047 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 317 transitions. Word has length 1109 [2018-04-12 23:58:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:49,048 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 317 transitions. [2018-04-12 23:58:49,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 23:58:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 317 transitions. [2018-04-12 23:58:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2018-04-12 23:58:49,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:49,054 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 23:58:49,054 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 23:58:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1097319795, now seen corresponding path program 23 times [2018-04-12 23:58:49,055 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:49,113 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:50,046 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 23:58:50,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:50,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 23:58:50,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:50,047 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 23:58:50,047 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 23:58:50,048 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 23:58:50,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 23:58:50,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 23:58:50,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-12 23:58:50,048 INFO L87 Difference]: Start difference. First operand 290 states and 317 transitions. Second operand 28 states. [2018-04-12 23:58:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:50,241 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2018-04-12 23:58:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 23:58:50,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1156 [2018-04-12 23:58:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:50,243 INFO L225 Difference]: With dead ends: 302 [2018-04-12 23:58:50,243 INFO L226 Difference]: Without dead ends: 302 [2018-04-12 23:58:50,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-12 23:58:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-12 23:58:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2018-04-12 23:58:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-12 23:58:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-04-12 23:58:50,246 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 1156 [2018-04-12 23:58:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:50,247 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-04-12 23:58:50,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 23:58:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-04-12 23:58:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-04-12 23:58:50,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:50,253 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 23:58:50,253 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 23:58:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1268694221, now seen corresponding path program 24 times [2018-04-12 23:58:50,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:50,317 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:51,113 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 23:58:51,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:51,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-12 23:58:51,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:51,114 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 23:58:51,114 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 23:58:51,115 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 23:58:51,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 23:58:51,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 23:58:51,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-12 23:58:51,115 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 29 states. [2018-04-12 23:58:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:51,298 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2018-04-12 23:58:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 23:58:51,299 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1203 [2018-04-12 23:58:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:51,300 INFO L225 Difference]: With dead ends: 309 [2018-04-12 23:58:51,300 INFO L226 Difference]: Without dead ends: 309 [2018-04-12 23:58:51,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-12 23:58:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-12 23:58:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2018-04-12 23:58:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-12 23:58:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 333 transitions. [2018-04-12 23:58:51,306 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 333 transitions. Word has length 1203 [2018-04-12 23:58:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:51,307 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 333 transitions. [2018-04-12 23:58:51,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 23:58:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 333 transitions. [2018-04-12 23:58:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2018-04-12 23:58:51,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:51,318 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 23:58:51,318 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 23:58:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash 99365325, now seen corresponding path program 25 times [2018-04-12 23:58:51,318 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:51,417 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:52,363 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 23:58:52,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:52,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 23:58:52,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:52,364 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 23:58:52,364 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 23:58:52,364 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 23:58:52,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 23:58:52,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 23:58:52,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-12 23:58:52,365 INFO L87 Difference]: Start difference. First operand 304 states and 333 transitions. Second operand 30 states. [2018-04-12 23:58:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:52,553 INFO L93 Difference]: Finished difference Result 316 states and 347 transitions. [2018-04-12 23:58:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 23:58:52,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1250 [2018-04-12 23:58:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:52,555 INFO L225 Difference]: With dead ends: 316 [2018-04-12 23:58:52,555 INFO L226 Difference]: Without dead ends: 316 [2018-04-12 23:58:52,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-12 23:58:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-12 23:58:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2018-04-12 23:58:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-12 23:58:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-04-12 23:58:52,560 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 1250 [2018-04-12 23:58:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:52,561 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-04-12 23:58:52,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 23:58:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-04-12 23:58:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-04-12 23:58:52,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:52,573 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 23:58:52,573 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 23:58:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash -41622541, now seen corresponding path program 26 times [2018-04-12 23:58:52,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:52,680 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:53,575 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 23:58:53,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:53,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-12 23:58:53,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:53,575 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 23:58:53,576 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 23:58:53,576 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 23:58:53,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 23:58:53,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 23:58:53,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-12 23:58:53,577 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 31 states. [2018-04-12 23:58:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:53,787 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-04-12 23:58:53,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 23:58:53,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1297 [2018-04-12 23:58:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:53,788 INFO L225 Difference]: With dead ends: 323 [2018-04-12 23:58:53,788 INFO L226 Difference]: Without dead ends: 323 [2018-04-12 23:58:53,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-12 23:58:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-12 23:58:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2018-04-12 23:58:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-12 23:58:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 349 transitions. [2018-04-12 23:58:53,792 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 349 transitions. Word has length 1297 [2018-04-12 23:58:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:53,793 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 349 transitions. [2018-04-12 23:58:53,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 23:58:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 349 transitions. [2018-04-12 23:58:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2018-04-12 23:58:53,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:53,801 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 23:58:53,801 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 23:58:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1148323571, now seen corresponding path program 27 times [2018-04-12 23:58:53,802 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:53,874 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:54,798 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 23:58:54,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:54,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 23:58:54,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:54,799 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 23:58:54,799 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 23:58:54,799 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 23:58:54,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 23:58:54,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 23:58:54,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-12 23:58:54,801 INFO L87 Difference]: Start difference. First operand 318 states and 349 transitions. Second operand 32 states. [2018-04-12 23:58:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:55,018 INFO L93 Difference]: Finished difference Result 330 states and 363 transitions. [2018-04-12 23:58:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 23:58:55,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1344 [2018-04-12 23:58:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:55,019 INFO L225 Difference]: With dead ends: 330 [2018-04-12 23:58:55,019 INFO L226 Difference]: Without dead ends: 330 [2018-04-12 23:58:55,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-12 23:58:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-12 23:58:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2018-04-12 23:58:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-12 23:58:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 357 transitions. [2018-04-12 23:58:55,024 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 357 transitions. Word has length 1344 [2018-04-12 23:58:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:55,024 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 357 transitions. [2018-04-12 23:58:55,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 23:58:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 357 transitions. [2018-04-12 23:58:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1392 [2018-04-12 23:58:55,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:55,032 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 23:58:55,032 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 23:58:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1816179891, now seen corresponding path program 28 times [2018-04-12 23:58:55,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:55,108 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:55,927 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 23:58:55,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:55,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-12 23:58:55,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:55,928 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 23:58:55,928 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 23:58:55,929 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 23:58:55,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 23:58:55,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 23:58:55,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 23:58:55,930 INFO L87 Difference]: Start difference. First operand 325 states and 357 transitions. Second operand 33 states. [2018-04-12 23:58:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:56,089 INFO L93 Difference]: Finished difference Result 337 states and 371 transitions. [2018-04-12 23:58:56,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 23:58:56,089 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1391 [2018-04-12 23:58:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:56,090 INFO L225 Difference]: With dead ends: 337 [2018-04-12 23:58:56,090 INFO L226 Difference]: Without dead ends: 337 [2018-04-12 23:58:56,090 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 23:58:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-12 23:58:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2018-04-12 23:58:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-04-12 23:58:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 365 transitions. [2018-04-12 23:58:56,094 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 365 transitions. Word has length 1391 [2018-04-12 23:58:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:56,094 INFO L459 AbstractCegarLoop]: Abstraction has 332 states and 365 transitions. [2018-04-12 23:58:56,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 23:58:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 365 transitions. [2018-04-12 23:58:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1439 [2018-04-12 23:58:56,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:56,103 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 23:58:56,103 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 23:58:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -957247411, now seen corresponding path program 29 times [2018-04-12 23:58:56,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:56,180 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:57,169 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 23:58:57,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:57,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 23:58:57,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:57,170 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 23:58:57,170 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 23:58:57,170 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 23:58:57,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 23:58:57,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 23:58:57,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 23:58:57,171 INFO L87 Difference]: Start difference. First operand 332 states and 365 transitions. Second operand 34 states. [2018-04-12 23:58:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:57,349 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-04-12 23:58:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 23:58:57,349 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1438 [2018-04-12 23:58:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:57,350 INFO L225 Difference]: With dead ends: 344 [2018-04-12 23:58:57,350 INFO L226 Difference]: Without dead ends: 344 [2018-04-12 23:58:57,351 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 23:58:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-12 23:58:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2018-04-12 23:58:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-12 23:58:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 373 transitions. [2018-04-12 23:58:57,354 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 373 transitions. Word has length 1438 [2018-04-12 23:58:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:57,354 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 373 transitions. [2018-04-12 23:58:57,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 23:58:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 373 transitions. [2018-04-12 23:58:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-04-12 23:58:57,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:57,363 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 23:58:57,363 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 23:58:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1834961549, now seen corresponding path program 30 times [2018-04-12 23:58:57,364 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:57,445 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:58,456 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 23:58:58,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:58,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-12 23:58:58,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:58,457 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 23:58:58,457 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 23:58:58,458 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 23:58:58,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 23:58:58,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 23:58:58,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 23:58:58,458 INFO L87 Difference]: Start difference. First operand 339 states and 373 transitions. Second operand 35 states. [2018-04-12 23:58:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:58,634 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-04-12 23:58:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 23:58:58,634 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1485 [2018-04-12 23:58:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:58,636 INFO L225 Difference]: With dead ends: 351 [2018-04-12 23:58:58,636 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 23:58:58,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 23:58:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 23:58:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2018-04-12 23:58:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-12 23:58:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 381 transitions. [2018-04-12 23:58:58,639 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 381 transitions. Word has length 1485 [2018-04-12 23:58:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:58,639 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 381 transitions. [2018-04-12 23:58:58,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 23:58:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 381 transitions. [2018-04-12 23:58:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-04-12 23:58:58,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:58,648 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 23:58:58,648 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 23:58:58,649 INFO L82 PathProgramCache]: Analyzing trace with hash -326436979, now seen corresponding path program 31 times [2018-04-12 23:58:58,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:58,729 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:59,755 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 23:58:59,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:59,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 23:58:59,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:59,756 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 23:58:59,756 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 23:58:59,757 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 23:58:59,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-12 23:58:59,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-12 23:58:59,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 23:58:59,758 INFO L87 Difference]: Start difference. First operand 346 states and 381 transitions. Second operand 36 states. [2018-04-12 23:59:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:00,007 INFO L93 Difference]: Finished difference Result 358 states and 395 transitions. [2018-04-12 23:59:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 23:59:00,008 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1532 [2018-04-12 23:59:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:00,009 INFO L225 Difference]: With dead ends: 358 [2018-04-12 23:59:00,009 INFO L226 Difference]: Without dead ends: 358 [2018-04-12 23:59:00,009 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 23:59:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-12 23:59:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2018-04-12 23:59:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-12 23:59:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 389 transitions. [2018-04-12 23:59:00,012 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 389 transitions. Word has length 1532 [2018-04-12 23:59:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:00,013 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 389 transitions. [2018-04-12 23:59:00,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-12 23:59:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2018-04-12 23:59:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2018-04-12 23:59:00,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:00,022 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 23:59:00,022 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 23:59:00,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2052004301, now seen corresponding path program 32 times [2018-04-12 23:59:00,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:00,102 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:01,132 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 23:59:01,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:01,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-12 23:59:01,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:01,133 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 23:59:01,134 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 23:59:01,134 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 23:59:01,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 23:59:01,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 23:59:01,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 23:59:01,135 INFO L87 Difference]: Start difference. First operand 353 states and 389 transitions. Second operand 37 states. [2018-04-12 23:59:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:01,377 INFO L93 Difference]: Finished difference Result 365 states and 403 transitions. [2018-04-12 23:59:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 23:59:01,377 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1579 [2018-04-12 23:59:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:01,379 INFO L225 Difference]: With dead ends: 365 [2018-04-12 23:59:01,379 INFO L226 Difference]: Without dead ends: 365 [2018-04-12 23:59:01,379 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 23:59:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-12 23:59:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 360. [2018-04-12 23:59:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-12 23:59:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 397 transitions. [2018-04-12 23:59:01,382 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 397 transitions. Word has length 1579 [2018-04-12 23:59:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:01,383 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 397 transitions. [2018-04-12 23:59:01,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 23:59:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 397 transitions. [2018-04-12 23:59:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1627 [2018-04-12 23:59:01,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:01,393 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 23:59:01,393 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 23:59:01,393 INFO L82 PathProgramCache]: Analyzing trace with hash 231616205, now seen corresponding path program 33 times [2018-04-12 23:59:01,394 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:01,493 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:02,736 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 23:59:02,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:02,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 23:59:02,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:02,737 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 23:59:02,737 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 23:59:02,738 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 23:59:02,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 23:59:02,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 23:59:02,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 23:59:02,738 INFO L87 Difference]: Start difference. First operand 360 states and 397 transitions. Second operand 38 states. [2018-04-12 23:59:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:02,961 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2018-04-12 23:59:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 23:59:02,961 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1626 [2018-04-12 23:59:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:02,962 INFO L225 Difference]: With dead ends: 372 [2018-04-12 23:59:02,962 INFO L226 Difference]: Without dead ends: 372 [2018-04-12 23:59:02,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 23:59:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-12 23:59:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2018-04-12 23:59:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-12 23:59:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2018-04-12 23:59:02,966 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 1626 [2018-04-12 23:59:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:02,966 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2018-04-12 23:59:02,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 23:59:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2018-04-12 23:59:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1674 [2018-04-12 23:59:02,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:02,978 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 23:59:02,978 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 23:59:02,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1652734221, now seen corresponding path program 34 times [2018-04-12 23:59:02,979 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:03,068 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:04,230 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 23:59:04,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:04,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-12 23:59:04,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:04,231 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 23:59:04,231 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 23:59:04,232 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 23:59:04,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 23:59:04,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 23:59:04,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 23:59:04,232 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand 39 states. [2018-04-12 23:59:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:04,513 INFO L93 Difference]: Finished difference Result 379 states and 419 transitions. [2018-04-12 23:59:04,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 23:59:04,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1673 [2018-04-12 23:59:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:04,515 INFO L225 Difference]: With dead ends: 379 [2018-04-12 23:59:04,515 INFO L226 Difference]: Without dead ends: 379 [2018-04-12 23:59:04,515 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 23:59:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-12 23:59:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 374. [2018-04-12 23:59:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-12 23:59:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 413 transitions. [2018-04-12 23:59:04,518 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 413 transitions. Word has length 1673 [2018-04-12 23:59:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:04,519 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 413 transitions. [2018-04-12 23:59:04,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 23:59:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 413 transitions. [2018-04-12 23:59:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2018-04-12 23:59:04,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:04,530 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 23:59:04,531 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 23:59:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1764701709, now seen corresponding path program 35 times [2018-04-12 23:59:04,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:04,621 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:05,864 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 23:59:05,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:05,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 23:59:05,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:05,866 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 23:59:05,866 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 23:59:05,867 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 23:59:05,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 23:59:05,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 23:59:05,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 23:59:05,867 INFO L87 Difference]: Start difference. First operand 374 states and 413 transitions. Second operand 40 states. [2018-04-12 23:59:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:06,169 INFO L93 Difference]: Finished difference Result 386 states and 427 transitions. [2018-04-12 23:59:06,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 23:59:06,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1720 [2018-04-12 23:59:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:06,170 INFO L225 Difference]: With dead ends: 386 [2018-04-12 23:59:06,170 INFO L226 Difference]: Without dead ends: 386 [2018-04-12 23:59:06,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 23:59:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-12 23:59:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2018-04-12 23:59:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-12 23:59:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 421 transitions. [2018-04-12 23:59:06,174 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 421 transitions. Word has length 1720 [2018-04-12 23:59:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:06,174 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 421 transitions. [2018-04-12 23:59:06,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 23:59:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 421 transitions. [2018-04-12 23:59:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2018-04-12 23:59:06,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:06,187 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 23:59:06,187 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 23:59:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash 890361779, now seen corresponding path program 36 times [2018-04-12 23:59:06,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:06,284 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:07,588 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 23:59:07,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:07,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-12 23:59:07,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:07,590 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 23:59:07,590 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 23:59:07,590 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 23:59:07,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 23:59:07,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 23:59:07,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 23:59:07,591 INFO L87 Difference]: Start difference. First operand 381 states and 421 transitions. Second operand 41 states. [2018-04-12 23:59:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:07,906 INFO L93 Difference]: Finished difference Result 393 states and 435 transitions. [2018-04-12 23:59:07,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 23:59:07,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1767 [2018-04-12 23:59:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:07,908 INFO L225 Difference]: With dead ends: 393 [2018-04-12 23:59:07,908 INFO L226 Difference]: Without dead ends: 393 [2018-04-12 23:59:07,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 23:59:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-12 23:59:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-04-12 23:59:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-12 23:59:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 429 transitions. [2018-04-12 23:59:07,911 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 429 transitions. Word has length 1767 [2018-04-12 23:59:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:07,912 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 429 transitions. [2018-04-12 23:59:07,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 23:59:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 429 transitions. [2018-04-12 23:59:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1815 [2018-04-12 23:59:07,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:07,925 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 23:59:07,925 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 23:59:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash -635302579, now seen corresponding path program 37 times [2018-04-12 23:59:07,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:08,029 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:09,398 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 23:59:09,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:09,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 23:59:09,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:09,399 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 23:59:09,399 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 23:59:09,400 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 23:59:09,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 23:59:09,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 23:59:09,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 23:59:09,400 INFO L87 Difference]: Start difference. First operand 388 states and 429 transitions. Second operand 42 states. [2018-04-12 23:59:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:09,636 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2018-04-12 23:59:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 23:59:09,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1814 [2018-04-12 23:59:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:09,638 INFO L225 Difference]: With dead ends: 400 [2018-04-12 23:59:09,638 INFO L226 Difference]: Without dead ends: 400 [2018-04-12 23:59:09,638 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 23:59:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-04-12 23:59:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 395. [2018-04-12 23:59:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-12 23:59:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 437 transitions. [2018-04-12 23:59:09,641 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 437 transitions. Word has length 1814 [2018-04-12 23:59:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:09,642 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 437 transitions. [2018-04-12 23:59:09,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 23:59:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 437 transitions. [2018-04-12 23:59:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1862 [2018-04-12 23:59:09,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:09,655 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 23:59:09,655 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 23:59:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1786419315, now seen corresponding path program 38 times [2018-04-12 23:59:09,656 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:09,767 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:11,196 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 23:59:11,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:11,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-12 23:59:11,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:11,257 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 23:59:11,257 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 23:59:11,258 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 23:59:11,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 23:59:11,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 23:59:11,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 23:59:11,258 INFO L87 Difference]: Start difference. First operand 395 states and 437 transitions. Second operand 43 states. [2018-04-12 23:59:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:11,546 INFO L93 Difference]: Finished difference Result 407 states and 451 transitions. [2018-04-12 23:59:11,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 23:59:11,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1861 [2018-04-12 23:59:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:11,548 INFO L225 Difference]: With dead ends: 407 [2018-04-12 23:59:11,548 INFO L226 Difference]: Without dead ends: 407 [2018-04-12 23:59:11,548 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 23:59:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-12 23:59:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 402. [2018-04-12 23:59:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-12 23:59:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 445 transitions. [2018-04-12 23:59:11,552 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 445 transitions. Word has length 1861 [2018-04-12 23:59:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:11,552 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 445 transitions. [2018-04-12 23:59:11,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 23:59:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 445 transitions. [2018-04-12 23:59:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1909 [2018-04-12 23:59:11,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:11,566 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 23:59:11,566 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 23:59:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash 421180557, now seen corresponding path program 39 times [2018-04-12 23:59:11,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:11,684 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:13,241 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 23:59:13,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:13,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-12 23:59:13,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:13,243 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 23:59:13,243 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 23:59:13,244 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 23:59:13,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 23:59:13,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 23:59:13,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 23:59:13,244 INFO L87 Difference]: Start difference. First operand 402 states and 445 transitions. Second operand 44 states. [2018-04-12 23:59:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:13,594 INFO L93 Difference]: Finished difference Result 414 states and 459 transitions. [2018-04-12 23:59:13,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 23:59:13,594 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1908 [2018-04-12 23:59:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:13,596 INFO L225 Difference]: With dead ends: 414 [2018-04-12 23:59:13,596 INFO L226 Difference]: Without dead ends: 414 [2018-04-12 23:59:13,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 23:59:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-12 23:59:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 409. [2018-04-12 23:59:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-12 23:59:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 453 transitions. [2018-04-12 23:59:13,599 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 453 transitions. Word has length 1908 [2018-04-12 23:59:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:13,600 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 453 transitions. [2018-04-12 23:59:13,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 23:59:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 453 transitions. [2018-04-12 23:59:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-04-12 23:59:13,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:13,624 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 23:59:13,624 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 23:59:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash -557610701, now seen corresponding path program 40 times [2018-04-12 23:59:13,625 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:13,736 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:15,298 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 23:59:15,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:15,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-12 23:59:15,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:15,299 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 23:59:15,299 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 23:59:15,301 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 23:59:15,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-12 23:59:15,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-12 23:59:15,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 23:59:15,302 INFO L87 Difference]: Start difference. First operand 409 states and 453 transitions. Second operand 45 states. [2018-04-12 23:59:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:15,566 INFO L93 Difference]: Finished difference Result 421 states and 467 transitions. [2018-04-12 23:59:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-12 23:59:15,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1955 [2018-04-12 23:59:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:15,568 INFO L225 Difference]: With dead ends: 421 [2018-04-12 23:59:15,568 INFO L226 Difference]: Without dead ends: 421 [2018-04-12 23:59:15,569 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 23:59:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-12 23:59:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 416. [2018-04-12 23:59:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-04-12 23:59:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 461 transitions. [2018-04-12 23:59:15,573 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 461 transitions. Word has length 1955 [2018-04-12 23:59:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:15,574 INFO L459 AbstractCegarLoop]: Abstraction has 416 states and 461 transitions. [2018-04-12 23:59:15,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-12 23:59:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 461 transitions. [2018-04-12 23:59:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2003 [2018-04-12 23:59:15,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:15,593 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 23:59:15,593 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 23:59:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -74634291, now seen corresponding path program 41 times [2018-04-12 23:59:15,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:15,706 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:17,343 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 23:59:17,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:17,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 23:59:17,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:17,344 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 23:59:17,345 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 23:59:17,346 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 23:59:17,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 23:59:17,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 23:59:17,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 23:59:17,346 INFO L87 Difference]: Start difference. First operand 416 states and 461 transitions. Second operand 46 states. [2018-04-12 23:59:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:17,607 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2018-04-12 23:59:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 23:59:17,607 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2002 [2018-04-12 23:59:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:17,609 INFO L225 Difference]: With dead ends: 428 [2018-04-12 23:59:17,609 INFO L226 Difference]: Without dead ends: 428 [2018-04-12 23:59:17,610 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 23:59:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-12 23:59:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2018-04-12 23:59:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-12 23:59:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 469 transitions. [2018-04-12 23:59:17,614 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 469 transitions. Word has length 2002 [2018-04-12 23:59:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:17,615 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 469 transitions. [2018-04-12 23:59:17,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 23:59:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 469 transitions. [2018-04-12 23:59:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2050 [2018-04-12 23:59:17,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:17,631 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 23:59:17,631 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 23:59:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1979230707, now seen corresponding path program 42 times [2018-04-12 23:59:17,632 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:17,751 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:19,471 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 23:59:19,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:19,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-12 23:59:19,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:19,472 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 23:59:19,472 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 23:59:19,473 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 23:59:19,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-12 23:59:19,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-12 23:59:19,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 23:59:19,474 INFO L87 Difference]: Start difference. First operand 423 states and 469 transitions. Second operand 47 states. [2018-04-12 23:59:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:19,789 INFO L93 Difference]: Finished difference Result 435 states and 483 transitions. [2018-04-12 23:59:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 23:59:19,789 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2049 [2018-04-12 23:59:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:19,791 INFO L225 Difference]: With dead ends: 435 [2018-04-12 23:59:19,791 INFO L226 Difference]: Without dead ends: 435 [2018-04-12 23:59:19,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 23:59:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-12 23:59:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 430. [2018-04-12 23:59:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-04-12 23:59:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2018-04-12 23:59:19,795 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 2049 [2018-04-12 23:59:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:19,795 INFO L459 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2018-04-12 23:59:19,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-12 23:59:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2018-04-12 23:59:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2097 [2018-04-12 23:59:19,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:19,812 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 23:59:19,812 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 23:59:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1276284147, now seen corresponding path program 43 times [2018-04-12 23:59:19,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:19,973 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:21,701 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 23:59:21,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:21,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 23:59:21,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:21,702 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 23:59:21,702 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 23:59:21,703 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 23:59:21,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 23:59:21,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 23:59:21,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 23:59:21,704 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand 48 states. [2018-04-12 23:59:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:22,020 INFO L93 Difference]: Finished difference Result 442 states and 491 transitions. [2018-04-12 23:59:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 23:59:22,021 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2096 [2018-04-12 23:59:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:22,022 INFO L225 Difference]: With dead ends: 442 [2018-04-12 23:59:22,022 INFO L226 Difference]: Without dead ends: 442 [2018-04-12 23:59:22,023 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 23:59:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-12 23:59:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 437. [2018-04-12 23:59:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-12 23:59:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 485 transitions. [2018-04-12 23:59:22,026 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 485 transitions. Word has length 2096 [2018-04-12 23:59:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:22,027 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 485 transitions. [2018-04-12 23:59:22,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 23:59:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 485 transitions. [2018-04-12 23:59:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2144 [2018-04-12 23:59:22,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:22,044 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 23:59:22,044 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 23:59:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 388364979, now seen corresponding path program 44 times [2018-04-12 23:59:22,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:22,182 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:24,042 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 23:59:24,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:24,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-12 23:59:24,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:24,043 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 23:59:24,043 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 23:59:24,044 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 23:59:24,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-12 23:59:24,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-12 23:59:24,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 23:59:24,044 INFO L87 Difference]: Start difference. First operand 437 states and 485 transitions. Second operand 49 states. [2018-04-12 23:59:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:24,431 INFO L93 Difference]: Finished difference Result 449 states and 499 transitions. [2018-04-12 23:59:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 23:59:24,432 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2143 [2018-04-12 23:59:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:24,433 INFO L225 Difference]: With dead ends: 449 [2018-04-12 23:59:24,433 INFO L226 Difference]: Without dead ends: 449 [2018-04-12 23:59:24,434 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 23:59:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-12 23:59:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2018-04-12 23:59:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-12 23:59:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 493 transitions. [2018-04-12 23:59:24,437 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 493 transitions. Word has length 2143 [2018-04-12 23:59:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:24,438 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 493 transitions. [2018-04-12 23:59:24,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-12 23:59:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 493 transitions. [2018-04-12 23:59:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2191 [2018-04-12 23:59:24,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:24,463 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 23:59:24,464 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 23:59:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 296716877, now seen corresponding path program 45 times [2018-04-12 23:59:24,464 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:24,597 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:26,504 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 23:59:26,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:26,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 23:59:26,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:26,505 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 23:59:26,506 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 23:59:26,507 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 23:59:26,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 23:59:26,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 23:59:26,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 23:59:26,507 INFO L87 Difference]: Start difference. First operand 444 states and 493 transitions. Second operand 50 states. [2018-04-12 23:59:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:26,942 INFO L93 Difference]: Finished difference Result 456 states and 507 transitions. [2018-04-12 23:59:26,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 23:59:26,943 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2190 [2018-04-12 23:59:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:26,944 INFO L225 Difference]: With dead ends: 456 [2018-04-12 23:59:26,944 INFO L226 Difference]: Without dead ends: 456 [2018-04-12 23:59:26,945 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 23:59:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-12 23:59:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 451. [2018-04-12 23:59:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-04-12 23:59:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 501 transitions. [2018-04-12 23:59:26,948 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 501 transitions. Word has length 2190 [2018-04-12 23:59:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:26,949 INFO L459 AbstractCegarLoop]: Abstraction has 451 states and 501 transitions. [2018-04-12 23:59:26,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 23:59:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 501 transitions. [2018-04-12 23:59:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2238 [2018-04-12 23:59:26,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:26,968 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 23:59:26,968 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 23:59:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1817672563, now seen corresponding path program 46 times [2018-04-12 23:59:26,968 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:27,129 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:29,231 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 23:59:29,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:29,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-12 23:59:29,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:29,233 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 23:59:29,233 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 23:59:29,234 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 23:59:29,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-12 23:59:29,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-12 23:59:29,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 23:59:29,234 INFO L87 Difference]: Start difference. First operand 451 states and 501 transitions. Second operand 51 states. [2018-04-12 23:59:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:29,739 INFO L93 Difference]: Finished difference Result 463 states and 515 transitions. [2018-04-12 23:59:29,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-12 23:59:29,739 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2237 [2018-04-12 23:59:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:29,741 INFO L225 Difference]: With dead ends: 463 [2018-04-12 23:59:29,741 INFO L226 Difference]: Without dead ends: 463 [2018-04-12 23:59:29,741 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 23:59:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-12 23:59:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2018-04-12 23:59:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-12 23:59:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 509 transitions. [2018-04-12 23:59:29,745 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 509 transitions. Word has length 2237 [2018-04-12 23:59:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:29,745 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 509 transitions. [2018-04-12 23:59:29,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-12 23:59:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 509 transitions. [2018-04-12 23:59:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2018-04-12 23:59:29,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:29,766 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 23:59:29,766 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 23:59:29,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1052282483, now seen corresponding path program 47 times [2018-04-12 23:59:29,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:29,910 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:32,042 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 23:59:32,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:32,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 23:59:32,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:32,043 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 23:59:32,043 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 23:59:32,044 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 23:59:32,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 23:59:32,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 23:59:32,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 23:59:32,045 INFO L87 Difference]: Start difference. First operand 458 states and 509 transitions. Second operand 52 states. [2018-04-12 23:59:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:32,542 INFO L93 Difference]: Finished difference Result 470 states and 523 transitions. [2018-04-12 23:59:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 23:59:32,542 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2284 [2018-04-12 23:59:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:32,544 INFO L225 Difference]: With dead ends: 470 [2018-04-12 23:59:32,544 INFO L226 Difference]: Without dead ends: 470 [2018-04-12 23:59:32,544 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 23:59:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-12 23:59:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 465. [2018-04-12 23:59:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-12 23:59:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 517 transitions. [2018-04-12 23:59:32,548 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 517 transitions. Word has length 2284 [2018-04-12 23:59:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:32,548 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 517 transitions. [2018-04-12 23:59:32,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 23:59:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 517 transitions. [2018-04-12 23:59:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-04-12 23:59:32,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:32,574 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 23:59:32,574 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 23:59:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1567019981, now seen corresponding path program 48 times [2018-04-12 23:59:32,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:32,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:34,901 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 23:59:34,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:34,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-12 23:59:34,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:34,903 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 23:59:34,903 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 23:59:34,905 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 23:59:34,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 23:59:34,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 23:59:34,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 23:59:34,905 INFO L87 Difference]: Start difference. First operand 465 states and 517 transitions. Second operand 53 states. [2018-04-12 23:59:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:35,225 INFO L93 Difference]: Finished difference Result 477 states and 531 transitions. [2018-04-12 23:59:35,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 23:59:35,226 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 2331 [2018-04-12 23:59:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:35,228 INFO L225 Difference]: With dead ends: 477 [2018-04-12 23:59:35,228 INFO L226 Difference]: Without dead ends: 477 [2018-04-12 23:59:35,228 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 23:59:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-12 23:59:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 472. [2018-04-12 23:59:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-12 23:59:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 525 transitions. [2018-04-12 23:59:35,232 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 525 transitions. Word has length 2331 [2018-04-12 23:59:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:35,232 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 525 transitions. [2018-04-12 23:59:35,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 23:59:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 525 transitions. [2018-04-12 23:59:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2379 [2018-04-12 23:59:35,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:35,253 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 23:59:35,253 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 23:59:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1943459635, now seen corresponding path program 49 times [2018-04-12 23:59:35,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:35,431 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:37,663 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 23:59:37,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:37,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 23:59:37,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:37,665 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 23:59:37,665 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 23:59:37,666 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 23:59:37,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 23:59:37,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 23:59:37,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 23:59:37,667 INFO L87 Difference]: Start difference. First operand 472 states and 525 transitions. Second operand 54 states. [2018-04-12 23:59:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:38,133 INFO L93 Difference]: Finished difference Result 484 states and 539 transitions. [2018-04-12 23:59:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 23:59:38,133 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2378 [2018-04-12 23:59:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:38,135 INFO L225 Difference]: With dead ends: 484 [2018-04-12 23:59:38,135 INFO L226 Difference]: Without dead ends: 484 [2018-04-12 23:59:38,135 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 23:59:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-12 23:59:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 479. [2018-04-12 23:59:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-04-12 23:59:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 533 transitions. [2018-04-12 23:59:38,139 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 533 transitions. Word has length 2378 [2018-04-12 23:59:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:38,140 INFO L459 AbstractCegarLoop]: Abstraction has 479 states and 533 transitions. [2018-04-12 23:59:38,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 23:59:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 533 transitions. [2018-04-12 23:59:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2426 [2018-04-12 23:59:38,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:38,161 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 23:59:38,161 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 23:59:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash 704056563, now seen corresponding path program 50 times [2018-04-12 23:59:38,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:38,317 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:40,660 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 23:59:40,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:40,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-12 23:59:40,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:40,662 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 23:59:40,662 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 23:59:40,663 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 23:59:40,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 23:59:40,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 23:59:40,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 23:59:40,664 INFO L87 Difference]: Start difference. First operand 479 states and 533 transitions. Second operand 55 states. [2018-04-12 23:59:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:41,195 INFO L93 Difference]: Finished difference Result 491 states and 547 transitions. [2018-04-12 23:59:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 23:59:41,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 2425 [2018-04-12 23:59:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:41,199 INFO L225 Difference]: With dead ends: 491 [2018-04-12 23:59:41,199 INFO L226 Difference]: Without dead ends: 491 [2018-04-12 23:59:41,199 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 23:59:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-12 23:59:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 486. [2018-04-12 23:59:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-04-12 23:59:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 541 transitions. [2018-04-12 23:59:41,203 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 541 transitions. Word has length 2425 [2018-04-12 23:59:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:41,203 INFO L459 AbstractCegarLoop]: Abstraction has 486 states and 541 transitions. [2018-04-12 23:59:41,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 23:59:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 541 transitions. [2018-04-12 23:59:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2473 [2018-04-12 23:59:41,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:41,225 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 23:59:41,225 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 23:59:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1731678195, now seen corresponding path program 51 times [2018-04-12 23:59:41,226 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:41,380 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:43,981 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 23:59:43,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:43,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 23:59:43,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:43,982 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 23:59:43,982 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 23:59:43,984 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 23:59:43,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 23:59:43,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 23:59:43,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 23:59:43,984 INFO L87 Difference]: Start difference. First operand 486 states and 541 transitions. Second operand 56 states. [2018-04-12 23:59:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:44,444 INFO L93 Difference]: Finished difference Result 498 states and 555 transitions. [2018-04-12 23:59:44,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 23:59:44,444 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2472 [2018-04-12 23:59:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:44,446 INFO L225 Difference]: With dead ends: 498 [2018-04-12 23:59:44,446 INFO L226 Difference]: Without dead ends: 498 [2018-04-12 23:59:44,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 23:59:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-04-12 23:59:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 493. [2018-04-12 23:59:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-12 23:59:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 549 transitions. [2018-04-12 23:59:44,450 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 549 transitions. Word has length 2472 [2018-04-12 23:59:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:44,451 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 549 transitions. [2018-04-12 23:59:44,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 23:59:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 549 transitions. [2018-04-12 23:59:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2520 [2018-04-12 23:59:44,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:44,473 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 23:59:44,473 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 23:59:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1971133875, now seen corresponding path program 52 times [2018-04-12 23:59:44,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:44,628 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:47,166 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 23:59:47,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:47,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-12 23:59:47,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:47,167 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 23:59:47,168 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 23:59:47,169 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 23:59:47,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-12 23:59:47,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-12 23:59:47,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 23:59:47,169 INFO L87 Difference]: Start difference. First operand 493 states and 549 transitions. Second operand 57 states. [2018-04-12 23:59:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:47,535 INFO L93 Difference]: Finished difference Result 505 states and 563 transitions. [2018-04-12 23:59:47,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-12 23:59:47,535 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 2519 [2018-04-12 23:59:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:47,537 INFO L225 Difference]: With dead ends: 505 [2018-04-12 23:59:47,537 INFO L226 Difference]: Without dead ends: 505 [2018-04-12 23:59:47,537 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 23:59:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-04-12 23:59:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 500. [2018-04-12 23:59:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-04-12 23:59:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 557 transitions. [2018-04-12 23:59:47,541 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 557 transitions. Word has length 2519 [2018-04-12 23:59:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:47,542 INFO L459 AbstractCegarLoop]: Abstraction has 500 states and 557 transitions. [2018-04-12 23:59:47,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-12 23:59:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 557 transitions. [2018-04-12 23:59:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2567 [2018-04-12 23:59:47,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:47,565 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 23:59:47,565 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 23:59:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1432746163, now seen corresponding path program 53 times [2018-04-12 23:59:47,566 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:47,728 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:50,338 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 23:59:50,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:50,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 23:59:50,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:50,339 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 23:59:50,339 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 23:59:50,341 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 23:59:50,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 23:59:50,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 23:59:50,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 23:59:50,341 INFO L87 Difference]: Start difference. First operand 500 states and 557 transitions. Second operand 58 states. [2018-04-12 23:59:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:50,906 INFO L93 Difference]: Finished difference Result 512 states and 571 transitions. [2018-04-12 23:59:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-12 23:59:50,907 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2566 [2018-04-12 23:59:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:50,909 INFO L225 Difference]: With dead ends: 512 [2018-04-12 23:59:50,909 INFO L226 Difference]: Without dead ends: 512 [2018-04-12 23:59:50,909 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 23:59:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-04-12 23:59:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 507. [2018-04-12 23:59:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-04-12 23:59:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 565 transitions. [2018-04-12 23:59:50,913 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 565 transitions. Word has length 2566 [2018-04-12 23:59:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:50,914 INFO L459 AbstractCegarLoop]: Abstraction has 507 states and 565 transitions. [2018-04-12 23:59:50,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 23:59:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 565 transitions. [2018-04-12 23:59:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2614 [2018-04-12 23:59:50,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:50,938 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 23:59:50,938 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 23:59:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1153999245, now seen corresponding path program 54 times [2018-04-12 23:59:50,938 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:51,102 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:53,862 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 23:59:53,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:53,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-12 23:59:53,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:53,863 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 23:59:53,863 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 23:59:53,865 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 23:59:53,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-12 23:59:53,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-12 23:59:53,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 23:59:53,865 INFO L87 Difference]: Start difference. First operand 507 states and 565 transitions. Second operand 59 states. [2018-04-12 23:59:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:54,477 INFO L93 Difference]: Finished difference Result 519 states and 579 transitions. [2018-04-12 23:59:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-12 23:59:54,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 2613 [2018-04-12 23:59:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:54,481 INFO L225 Difference]: With dead ends: 519 [2018-04-12 23:59:54,481 INFO L226 Difference]: Without dead ends: 519 [2018-04-12 23:59:54,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 23:59:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-12 23:59:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2018-04-12 23:59:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-04-12 23:59:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 573 transitions. [2018-04-12 23:59:54,488 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 573 transitions. Word has length 2613 [2018-04-12 23:59:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:54,489 INFO L459 AbstractCegarLoop]: Abstraction has 514 states and 573 transitions. [2018-04-12 23:59:54,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-12 23:59:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 573 transitions. [2018-04-12 23:59:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2661 [2018-04-12 23:59:54,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:54,519 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 23:59:54,519 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 23:59:54,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1645293197, now seen corresponding path program 55 times [2018-04-12 23:59:54,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:54,727 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:59:57,575 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 23:59:57,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:59:57,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 23:59:57,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:59:57,577 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 23:59:57,577 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 23:59:57,579 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 23:59:57,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 23:59:57,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 23:59:57,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 23:59:57,579 INFO L87 Difference]: Start difference. First operand 514 states and 573 transitions. Second operand 60 states. [2018-04-12 23:59:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:59:58,180 INFO L93 Difference]: Finished difference Result 526 states and 587 transitions. [2018-04-12 23:59:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-12 23:59:58,181 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2660 [2018-04-12 23:59:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:59:58,183 INFO L225 Difference]: With dead ends: 526 [2018-04-12 23:59:58,183 INFO L226 Difference]: Without dead ends: 526 [2018-04-12 23:59:58,183 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 23:59:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-04-12 23:59:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 521. [2018-04-12 23:59:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-12 23:59:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 581 transitions. [2018-04-12 23:59:58,188 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 581 transitions. Word has length 2660 [2018-04-12 23:59:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:59:58,189 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 581 transitions. [2018-04-12 23:59:58,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 23:59:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 581 transitions. [2018-04-12 23:59:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2708 [2018-04-12 23:59:58,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:59:58,216 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 23:59:58,216 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 23:59:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1271804109, now seen corresponding path program 56 times [2018-04-12 23:59:58,216 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:59:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:59:58,390 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:01,270 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-13 00:00:01,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:01,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-13 00:00:01,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:01,272 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-13 00:00:01,272 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-13 00:00:01,274 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-13 00:00:01,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 00:00:01,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 00:00:01,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 00:00:01,275 INFO L87 Difference]: Start difference. First operand 521 states and 581 transitions. Second operand 61 states. [2018-04-13 00:00:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:01,694 INFO L93 Difference]: Finished difference Result 533 states and 595 transitions. [2018-04-13 00:00:01,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 00:00:01,694 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 2707 [2018-04-13 00:00:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:01,696 INFO L225 Difference]: With dead ends: 533 [2018-04-13 00:00:01,696 INFO L226 Difference]: Without dead ends: 533 [2018-04-13 00:00:01,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 00:00:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-13 00:00:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 528. [2018-04-13 00:00:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-13 00:00:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 589 transitions. [2018-04-13 00:00:01,700 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 589 transitions. Word has length 2707 [2018-04-13 00:00:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:01,701 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 589 transitions. [2018-04-13 00:00:01,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 00:00:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 589 transitions. [2018-04-13 00:00:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2755 [2018-04-13 00:00:01,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:01,729 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-13 00:00:01,729 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-13 00:00:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2091001293, now seen corresponding path program 57 times [2018-04-13 00:00:01,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:02,003 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:05,131 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-13 00:00:05,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:05,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-13 00:00:05,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:05,133 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-13 00:00:05,133 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-13 00:00:05,135 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-13 00:00:05,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 00:00:05,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 00:00:05,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 00:00:05,136 INFO L87 Difference]: Start difference. First operand 528 states and 589 transitions. Second operand 62 states. [2018-04-13 00:00:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:05,819 INFO L93 Difference]: Finished difference Result 540 states and 603 transitions. [2018-04-13 00:00:05,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 00:00:05,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2754 [2018-04-13 00:00:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:05,822 INFO L225 Difference]: With dead ends: 540 [2018-04-13 00:00:05,822 INFO L226 Difference]: Without dead ends: 540 [2018-04-13 00:00:05,822 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-13 00:00:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-13 00:00:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2018-04-13 00:00:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-04-13 00:00:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 597 transitions. [2018-04-13 00:00:05,826 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 597 transitions. Word has length 2754 [2018-04-13 00:00:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:05,827 INFO L459 AbstractCegarLoop]: Abstraction has 535 states and 597 transitions. [2018-04-13 00:00:05,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 00:00:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 597 transitions. [2018-04-13 00:00:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2802 [2018-04-13 00:00:05,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:05,855 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-13 00:00:05,855 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-13 00:00:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1551396851, now seen corresponding path program 58 times [2018-04-13 00:00:05,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:06,043 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:09,136 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-13 00:00:09,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:09,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 00:00:09,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:09,137 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-13 00:00:09,138 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-13 00:00:09,139 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-13 00:00:09,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 00:00:09,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 00:00:09,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 00:00:09,140 INFO L87 Difference]: Start difference. First operand 535 states and 597 transitions. Second operand 63 states. [2018-04-13 00:00:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:09,832 INFO L93 Difference]: Finished difference Result 547 states and 611 transitions. [2018-04-13 00:00:09,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 00:00:09,832 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 2801 [2018-04-13 00:00:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:09,834 INFO L225 Difference]: With dead ends: 547 [2018-04-13 00:00:09,834 INFO L226 Difference]: Without dead ends: 547 [2018-04-13 00:00:09,834 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-13 00:00:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-13 00:00:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 542. [2018-04-13 00:00:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-13 00:00:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 605 transitions. [2018-04-13 00:00:09,838 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 605 transitions. Word has length 2801 [2018-04-13 00:00:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:09,839 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 605 transitions. [2018-04-13 00:00:09,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 00:00:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 605 transitions. [2018-04-13 00:00:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2849 [2018-04-13 00:00:09,867 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:09,867 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-13 00:00:09,867 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-13 00:00:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 348187917, now seen corresponding path program 59 times [2018-04-13 00:00:09,868 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:10,052 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:13,305 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-13 00:00:13,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:13,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-13 00:00:13,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:13,307 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-13 00:00:13,307 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-13 00:00:13,308 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-13 00:00:13,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 00:00:13,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 00:00:13,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 00:00:13,309 INFO L87 Difference]: Start difference. First operand 542 states and 605 transitions. Second operand 64 states. [2018-04-13 00:00:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:14,023 INFO L93 Difference]: Finished difference Result 554 states and 619 transitions. [2018-04-13 00:00:14,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 00:00:14,023 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2848 [2018-04-13 00:00:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:14,025 INFO L225 Difference]: With dead ends: 554 [2018-04-13 00:00:14,025 INFO L226 Difference]: Without dead ends: 554 [2018-04-13 00:00:14,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 00:00:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-13 00:00:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 549. [2018-04-13 00:00:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-04-13 00:00:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 613 transitions. [2018-04-13 00:00:14,030 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 613 transitions. Word has length 2848 [2018-04-13 00:00:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:14,030 INFO L459 AbstractCegarLoop]: Abstraction has 549 states and 613 transitions. [2018-04-13 00:00:14,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 00:00:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 613 transitions. [2018-04-13 00:00:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2896 [2018-04-13 00:00:14,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:14,061 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-13 00:00:14,061 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-13 00:00:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1290321741, now seen corresponding path program 60 times [2018-04-13 00:00:14,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:14,301 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:18,948 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-13 00:00:18,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:18,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-13 00:00:18,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:18,949 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-13 00:00:18,950 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-13 00:00:18,951 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-13 00:00:18,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 00:00:18,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 00:00:18,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 00:00:18,952 INFO L87 Difference]: Start difference. First operand 549 states and 613 transitions. Second operand 65 states. [2018-04-13 00:00:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:19,671 INFO L93 Difference]: Finished difference Result 561 states and 627 transitions. [2018-04-13 00:00:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 00:00:19,671 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 2895 [2018-04-13 00:00:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:19,673 INFO L225 Difference]: With dead ends: 561 [2018-04-13 00:00:19,673 INFO L226 Difference]: Without dead ends: 561 [2018-04-13 00:00:19,674 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-13 00:00:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-13 00:00:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 556. [2018-04-13 00:00:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-04-13 00:00:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 621 transitions. [2018-04-13 00:00:19,677 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 621 transitions. Word has length 2895 [2018-04-13 00:00:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:19,678 INFO L459 AbstractCegarLoop]: Abstraction has 556 states and 621 transitions. [2018-04-13 00:00:19,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 00:00:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 621 transitions. [2018-04-13 00:00:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2943 [2018-04-13 00:00:19,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:19,708 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-13 00:00:19,708 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-13 00:00:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash -505314227, now seen corresponding path program 61 times [2018-04-13 00:00:19,709 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:19,903 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:23,233 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-13 00:00:23,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:23,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-13 00:00:23,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:23,235 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-13 00:00:23,235 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-13 00:00:23,236 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-13 00:00:23,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 00:00:23,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 00:00:23,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 00:00:23,237 INFO L87 Difference]: Start difference. First operand 556 states and 621 transitions. Second operand 66 states. [2018-04-13 00:00:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:23,698 INFO L93 Difference]: Finished difference Result 568 states and 635 transitions. [2018-04-13 00:00:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 00:00:23,698 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2942 [2018-04-13 00:00:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:23,700 INFO L225 Difference]: With dead ends: 568 [2018-04-13 00:00:23,700 INFO L226 Difference]: Without dead ends: 568 [2018-04-13 00:00:23,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 00:00:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-04-13 00:00:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 563. [2018-04-13 00:00:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-13 00:00:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 629 transitions. [2018-04-13 00:00:23,706 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 629 transitions. Word has length 2942 [2018-04-13 00:00:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:23,707 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 629 transitions. [2018-04-13 00:00:23,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 00:00:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 629 transitions. [2018-04-13 00:00:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2990 [2018-04-13 00:00:23,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:23,738 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-13 00:00:23,739 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-13 00:00:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2048541043, now seen corresponding path program 62 times [2018-04-13 00:00:23,739 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:24,005 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:27,619 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-13 00:00:27,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:27,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-13 00:00:27,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:27,621 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-13 00:00:27,621 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-13 00:00:27,623 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-13 00:00:27,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 00:00:27,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 00:00:27,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 00:00:27,624 INFO L87 Difference]: Start difference. First operand 563 states and 629 transitions. Second operand 67 states. [2018-04-13 00:00:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:28,432 INFO L93 Difference]: Finished difference Result 575 states and 643 transitions. [2018-04-13 00:00:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 00:00:28,432 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 2989 [2018-04-13 00:00:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:28,435 INFO L225 Difference]: With dead ends: 575 [2018-04-13 00:00:28,435 INFO L226 Difference]: Without dead ends: 575 [2018-04-13 00:00:28,435 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-13 00:00:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-13 00:00:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 570. [2018-04-13 00:00:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-04-13 00:00:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 637 transitions. [2018-04-13 00:00:28,439 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 637 transitions. Word has length 2989 [2018-04-13 00:00:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:28,440 INFO L459 AbstractCegarLoop]: Abstraction has 570 states and 637 transitions. [2018-04-13 00:00:28,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 00:00:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 637 transitions. [2018-04-13 00:00:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3037 [2018-04-13 00:00:28,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:28,472 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-13 00:00:28,472 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-13 00:00:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2021125005, now seen corresponding path program 63 times [2018-04-13 00:00:28,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:28,681 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:32,332 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-13 00:00:32,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:32,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 00:00:32,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:32,334 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-13 00:00:32,334 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-13 00:00:32,336 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-13 00:00:32,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 00:00:32,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 00:00:32,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 00:00:32,337 INFO L87 Difference]: Start difference. First operand 570 states and 637 transitions. Second operand 68 states. [2018-04-13 00:00:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:33,009 INFO L93 Difference]: Finished difference Result 582 states and 651 transitions. [2018-04-13 00:00:33,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 00:00:33,009 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3036 [2018-04-13 00:00:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:33,011 INFO L225 Difference]: With dead ends: 582 [2018-04-13 00:00:33,011 INFO L226 Difference]: Without dead ends: 582 [2018-04-13 00:00:33,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 00:00:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-04-13 00:00:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 577. [2018-04-13 00:00:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-04-13 00:00:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 645 transitions. [2018-04-13 00:00:33,017 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 645 transitions. Word has length 3036 [2018-04-13 00:00:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:33,019 INFO L459 AbstractCegarLoop]: Abstraction has 577 states and 645 transitions. [2018-04-13 00:00:33,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 00:00:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 645 transitions. [2018-04-13 00:00:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3084 [2018-04-13 00:00:33,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:33,067 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-13 00:00:33,068 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-13 00:00:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -158502349, now seen corresponding path program 64 times [2018-04-13 00:00:33,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:33,348 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:37,044 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-13 00:00:37,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:37,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-13 00:00:37,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:37,045 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-13 00:00:37,046 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-13 00:00:37,048 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-13 00:00:37,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 00:00:37,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 00:00:37,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 00:00:37,048 INFO L87 Difference]: Start difference. First operand 577 states and 645 transitions. Second operand 69 states. [2018-04-13 00:00:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:37,881 INFO L93 Difference]: Finished difference Result 589 states and 659 transitions. [2018-04-13 00:00:37,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 00:00:37,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 3083 [2018-04-13 00:00:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:37,884 INFO L225 Difference]: With dead ends: 589 [2018-04-13 00:00:37,884 INFO L226 Difference]: Without dead ends: 589 [2018-04-13 00:00:37,884 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-13 00:00:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-13 00:00:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 584. [2018-04-13 00:00:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-04-13 00:00:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 653 transitions. [2018-04-13 00:00:37,889 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 653 transitions. Word has length 3083 [2018-04-13 00:00:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:37,889 INFO L459 AbstractCegarLoop]: Abstraction has 584 states and 653 transitions. [2018-04-13 00:00:37,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 00:00:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 653 transitions. [2018-04-13 00:00:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3131 [2018-04-13 00:00:37,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:37,923 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-13 00:00:37,923 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-13 00:00:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1980226867, now seen corresponding path program 65 times [2018-04-13 00:00:37,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:38,142 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:41,950 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-13 00:00:41,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:41,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-13 00:00:41,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:41,952 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-13 00:00:41,952 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-13 00:00:41,954 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-13 00:00:41,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-13 00:00:41,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-13 00:00:41,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 00:00:41,955 INFO L87 Difference]: Start difference. First operand 584 states and 653 transitions. Second operand 70 states. [2018-04-13 00:00:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:42,512 INFO L93 Difference]: Finished difference Result 596 states and 667 transitions. [2018-04-13 00:00:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 00:00:42,512 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3130 [2018-04-13 00:00:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:42,515 INFO L225 Difference]: With dead ends: 596 [2018-04-13 00:00:42,515 INFO L226 Difference]: Without dead ends: 596 [2018-04-13 00:00:42,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 00:00:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-04-13 00:00:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 591. [2018-04-13 00:00:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-04-13 00:00:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 661 transitions. [2018-04-13 00:00:42,520 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 661 transitions. Word has length 3130 [2018-04-13 00:00:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:42,520 INFO L459 AbstractCegarLoop]: Abstraction has 591 states and 661 transitions. [2018-04-13 00:00:42,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-13 00:00:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 661 transitions. [2018-04-13 00:00:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3178 [2018-04-13 00:00:42,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:42,555 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-13 00:00:42,555 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-13 00:00:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1333996813, now seen corresponding path program 66 times [2018-04-13 00:00:42,556 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:42,827 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:46,931 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-13 00:00:46,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:46,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-13 00:00:46,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:46,933 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-13 00:00:46,933 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-13 00:00:46,935 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-13 00:00:46,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 00:00:46,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 00:00:46,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 00:00:46,936 INFO L87 Difference]: Start difference. First operand 591 states and 661 transitions. Second operand 71 states. [2018-04-13 00:00:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:47,481 INFO L93 Difference]: Finished difference Result 603 states and 675 transitions. [2018-04-13 00:00:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 00:00:47,481 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 3177 [2018-04-13 00:00:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:47,484 INFO L225 Difference]: With dead ends: 603 [2018-04-13 00:00:47,484 INFO L226 Difference]: Without dead ends: 603 [2018-04-13 00:00:47,484 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-13 00:00:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-04-13 00:00:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2018-04-13 00:00:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-13 00:00:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 669 transitions. [2018-04-13 00:00:47,488 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 669 transitions. Word has length 3177 [2018-04-13 00:00:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:47,489 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 669 transitions. [2018-04-13 00:00:47,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 00:00:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 669 transitions. [2018-04-13 00:00:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3225 [2018-04-13 00:00:47,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:47,525 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-13 00:00:47,525 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-13 00:00:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 618015245, now seen corresponding path program 67 times [2018-04-13 00:00:47,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:47,749 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:51,746 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-13 00:00:51,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:51,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-13 00:00:51,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:51,748 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-13 00:00:51,749 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-13 00:00:51,751 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-13 00:00:51,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 00:00:51,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 00:00:51,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 00:00:51,751 INFO L87 Difference]: Start difference. First operand 598 states and 669 transitions. Second operand 72 states. [2018-04-13 00:00:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:52,415 INFO L93 Difference]: Finished difference Result 610 states and 683 transitions. [2018-04-13 00:00:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 00:00:52,451 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 3224 [2018-04-13 00:00:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:52,453 INFO L225 Difference]: With dead ends: 610 [2018-04-13 00:00:52,453 INFO L226 Difference]: Without dead ends: 610 [2018-04-13 00:00:52,453 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-13 00:00:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-04-13 00:00:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2018-04-13 00:00:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-13 00:00:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 677 transitions. [2018-04-13 00:00:52,457 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 677 transitions. Word has length 3224 [2018-04-13 00:00:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:52,458 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 677 transitions. [2018-04-13 00:00:52,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 00:00:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 677 transitions. [2018-04-13 00:00:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3272 [2018-04-13 00:00:52,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:52,495 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-13 00:00:52,495 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-13 00:00:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 854877107, now seen corresponding path program 68 times [2018-04-13 00:00:52,496 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:52,774 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:00:57,082 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-13 00:00:57,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:00:57,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-13 00:00:57,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:00:57,084 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-13 00:00:57,084 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-13 00:00:57,087 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-13 00:00:57,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 00:00:57,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 00:00:57,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 00:00:57,087 INFO L87 Difference]: Start difference. First operand 605 states and 677 transitions. Second operand 73 states. [2018-04-13 00:00:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:00:57,680 INFO L93 Difference]: Finished difference Result 617 states and 691 transitions. [2018-04-13 00:00:57,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 00:00:57,680 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 3271 [2018-04-13 00:00:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:00:57,683 INFO L225 Difference]: With dead ends: 617 [2018-04-13 00:00:57,683 INFO L226 Difference]: Without dead ends: 617 [2018-04-13 00:00:57,683 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-13 00:00:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-04-13 00:00:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 612. [2018-04-13 00:00:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-04-13 00:00:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 685 transitions. [2018-04-13 00:00:57,688 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 685 transitions. Word has length 3271 [2018-04-13 00:00:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:00:57,688 INFO L459 AbstractCegarLoop]: Abstraction has 612 states and 685 transitions. [2018-04-13 00:00:57,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 00:00:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 685 transitions. [2018-04-13 00:00:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3319 [2018-04-13 00:00:57,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:00:57,726 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-13 00:00:57,726 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-13 00:00:57,726 INFO L82 PathProgramCache]: Analyzing trace with hash -192544435, now seen corresponding path program 69 times [2018-04-13 00:00:57,726 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:00:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:00:57,989 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:02,345 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-13 00:01:02,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:02,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-13 00:01:02,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:02,347 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-13 00:01:02,347 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-13 00:01:02,349 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-13 00:01:02,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 00:01:02,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 00:01:02,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 00:01:02,350 INFO L87 Difference]: Start difference. First operand 612 states and 685 transitions. Second operand 74 states. [2018-04-13 00:01:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:03,015 INFO L93 Difference]: Finished difference Result 624 states and 699 transitions. [2018-04-13 00:01:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 00:01:03,015 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 3318 [2018-04-13 00:01:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:03,018 INFO L225 Difference]: With dead ends: 624 [2018-04-13 00:01:03,018 INFO L226 Difference]: Without dead ends: 624 [2018-04-13 00:01:03,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 00:01:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-04-13 00:01:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 619. [2018-04-13 00:01:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-04-13 00:01:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 693 transitions. [2018-04-13 00:01:03,022 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 693 transitions. Word has length 3318 [2018-04-13 00:01:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:03,023 INFO L459 AbstractCegarLoop]: Abstraction has 619 states and 693 transitions. [2018-04-13 00:01:03,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 00:01:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 693 transitions. [2018-04-13 00:01:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3366 [2018-04-13 00:01:03,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:03,062 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-13 00:01:03,062 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-13 00:01:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -872405901, now seen corresponding path program 70 times [2018-04-13 00:01:03,062 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:03,304 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:07,795 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-13 00:01:07,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:07,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-13 00:01:07,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:07,797 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-13 00:01:07,797 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-13 00:01:07,800 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-13 00:01:07,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 00:01:07,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 00:01:07,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 00:01:07,800 INFO L87 Difference]: Start difference. First operand 619 states and 693 transitions. Second operand 75 states. [2018-04-13 00:01:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:08,803 INFO L93 Difference]: Finished difference Result 631 states and 707 transitions. [2018-04-13 00:01:08,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 00:01:08,803 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 3365 [2018-04-13 00:01:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:08,806 INFO L225 Difference]: With dead ends: 631 [2018-04-13 00:01:08,806 INFO L226 Difference]: Without dead ends: 631 [2018-04-13 00:01:08,806 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-13 00:01:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-04-13 00:01:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 626. [2018-04-13 00:01:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-04-13 00:01:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 701 transitions. [2018-04-13 00:01:08,813 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 701 transitions. Word has length 3365 [2018-04-13 00:01:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:08,814 INFO L459 AbstractCegarLoop]: Abstraction has 626 states and 701 transitions. [2018-04-13 00:01:08,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 00:01:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 701 transitions. [2018-04-13 00:01:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3413 [2018-04-13 00:01:08,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:08,853 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-13 00:01:08,854 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-13 00:01:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2122602355, now seen corresponding path program 71 times [2018-04-13 00:01:08,854 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:09,202 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:13,846 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-13 00:01:13,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:13,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-13 00:01:13,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:13,849 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-13 00:01:13,849 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-13 00:01:13,851 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-13 00:01:13,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 00:01:13,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 00:01:13,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 00:01:13,852 INFO L87 Difference]: Start difference. First operand 626 states and 701 transitions. Second operand 76 states. [2018-04-13 00:01:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:14,688 INFO L93 Difference]: Finished difference Result 638 states and 715 transitions. [2018-04-13 00:01:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 00:01:14,688 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 3412 [2018-04-13 00:01:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:14,691 INFO L225 Difference]: With dead ends: 638 [2018-04-13 00:01:14,691 INFO L226 Difference]: Without dead ends: 638 [2018-04-13 00:01:14,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 00:01:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-13 00:01:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 633. [2018-04-13 00:01:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-13 00:01:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 709 transitions. [2018-04-13 00:01:14,699 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 709 transitions. Word has length 3412 [2018-04-13 00:01:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:14,700 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 709 transitions. [2018-04-13 00:01:14,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 00:01:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 709 transitions. [2018-04-13 00:01:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3460 [2018-04-13 00:01:14,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:14,740 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-13 00:01:14,740 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-13 00:01:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1286346035, now seen corresponding path program 72 times [2018-04-13 00:01:14,741 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:14,991 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:19,683 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-13 00:01:19,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:19,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-13 00:01:19,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:19,685 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-13 00:01:19,685 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-13 00:01:19,687 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-13 00:01:19,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 00:01:19,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 00:01:19,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 00:01:19,688 INFO L87 Difference]: Start difference. First operand 633 states and 709 transitions. Second operand 77 states. [2018-04-13 00:01:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:20,775 INFO L93 Difference]: Finished difference Result 645 states and 723 transitions. [2018-04-13 00:01:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 00:01:20,776 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 3459 [2018-04-13 00:01:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:20,779 INFO L225 Difference]: With dead ends: 645 [2018-04-13 00:01:20,779 INFO L226 Difference]: Without dead ends: 645 [2018-04-13 00:01:20,779 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-13 00:01:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-04-13 00:01:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 640. [2018-04-13 00:01:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-04-13 00:01:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 717 transitions. [2018-04-13 00:01:20,784 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 717 transitions. Word has length 3459 [2018-04-13 00:01:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:20,785 INFO L459 AbstractCegarLoop]: Abstraction has 640 states and 717 transitions. [2018-04-13 00:01:20,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 00:01:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 717 transitions. [2018-04-13 00:01:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3507 [2018-04-13 00:01:20,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:20,837 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-13 00:01:20,837 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-13 00:01:20,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1898651597, now seen corresponding path program 73 times [2018-04-13 00:01:20,838 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:21,127 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:25,984 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-13 00:01:25,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:25,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-13 00:01:25,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:25,986 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-13 00:01:25,986 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-13 00:01:25,989 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-13 00:01:25,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 00:01:25,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 00:01:25,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 00:01:25,989 INFO L87 Difference]: Start difference. First operand 640 states and 717 transitions. Second operand 78 states. [2018-04-13 00:01:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:26,632 INFO L93 Difference]: Finished difference Result 652 states and 731 transitions. [2018-04-13 00:01:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 00:01:26,632 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 3506 [2018-04-13 00:01:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:26,635 INFO L225 Difference]: With dead ends: 652 [2018-04-13 00:01:26,635 INFO L226 Difference]: Without dead ends: 652 [2018-04-13 00:01:26,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 00:01:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-13 00:01:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 647. [2018-04-13 00:01:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-04-13 00:01:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 725 transitions. [2018-04-13 00:01:26,640 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 725 transitions. Word has length 3506 [2018-04-13 00:01:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:26,640 INFO L459 AbstractCegarLoop]: Abstraction has 647 states and 725 transitions. [2018-04-13 00:01:26,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 00:01:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 725 transitions. [2018-04-13 00:01:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3554 [2018-04-13 00:01:26,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:26,683 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-13 00:01:26,683 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-13 00:01:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -922470925, now seen corresponding path program 74 times [2018-04-13 00:01:26,684 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:26,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 237834 backedges. 0 proven. 20102 refuted. 0 times theorem prover too weak. 217732 trivial. 0 not checked. [2018-04-13 00:01:31,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:31,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 00:01:31,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 108040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108040 trivial. 0 not checked. [2018-04-13 00:01:31,876 INFO L182 omatonBuilderFactory]: Interpolants [66817#(<= main_~i~2 76), 66816#(<= main_~i~2 75), 66739#true, 66741#(= main_~i~2 0), 66740#false, 66743#(<= main_~i~2 2), 66742#(<= main_~i~2 1), 66745#(<= main_~i~2 4), 66744#(<= main_~i~2 3), 66747#(<= main_~i~2 6), 66746#(<= main_~i~2 5), 66749#(<= main_~i~2 8), 66748#(<= main_~i~2 7), 66751#(<= main_~i~2 10), 66750#(<= main_~i~2 9), 66753#(<= main_~i~2 12), 66752#(<= main_~i~2 11), 66755#(<= main_~i~2 14), 66754#(<= main_~i~2 13), 66757#(<= main_~i~2 16), 66756#(<= main_~i~2 15), 66759#(<= main_~i~2 18), 66758#(<= main_~i~2 17), 66761#(<= main_~i~2 20), 66760#(<= main_~i~2 19), 66763#(<= main_~i~2 22), 66762#(<= main_~i~2 21), 66765#(<= main_~i~2 24), 66764#(<= main_~i~2 23), 66767#(<= main_~i~2 26), 66766#(<= main_~i~2 25), 66769#(<= main_~i~2 28), 66768#(<= main_~i~2 27), 66771#(<= main_~i~2 30), 66770#(<= main_~i~2 29), 66773#(<= main_~i~2 32), 66772#(<= main_~i~2 31), 66775#(<= main_~i~2 34), 66774#(<= main_~i~2 33), 66777#(<= main_~i~2 36), 66776#(<= main_~i~2 35), 66779#(<= main_~i~2 38), 66778#(<= main_~i~2 37), 66781#(<= main_~i~2 40), 66780#(<= main_~i~2 39), 66783#(<= main_~i~2 42), 66782#(<= main_~i~2 41), 66785#(<= main_~i~2 44), 66784#(<= main_~i~2 43), 66787#(<= main_~i~2 46), 66786#(<= main_~i~2 45), 66789#(<= main_~i~2 48), 66788#(<= main_~i~2 47), 66791#(<= main_~i~2 50), 66790#(<= main_~i~2 49), 66793#(<= main_~i~2 52), 66792#(<= main_~i~2 51), 66795#(<= main_~i~2 54), 66794#(<= main_~i~2 53), 66797#(<= main_~i~2 56), 66796#(<= main_~i~2 55), 66799#(<= main_~i~2 58), 66798#(<= main_~i~2 57), 66801#(<= main_~i~2 60), 66800#(<= main_~i~2 59), 66803#(<= main_~i~2 62), 66802#(<= main_~i~2 61), 66805#(<= main_~i~2 64), 66804#(<= main_~i~2 63), 66807#(<= main_~i~2 66), 66806#(<= main_~i~2 65), 66809#(<= main_~i~2 68), 66808#(<= main_~i~2 67), 66811#(<= main_~i~2 70), 66810#(<= main_~i~2 69), 66813#(<= main_~i~2 72), 66812#(<= main_~i~2 71), 66815#(<= main_~i~2 74), 66814#(<= main_~i~2 73)] [2018-04-13 00:01:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 237834 backedges. 0 proven. 20102 refuted. 0 times theorem prover too weak. 217732 trivial. 0 not checked. [2018-04-13 00:01:31,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-13 00:01:31,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-13 00:01:31,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 00:01:31,879 INFO L87 Difference]: Start difference. First operand 647 states and 725 transitions. Second operand 79 states. [2018-04-13 00:01:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:32,558 INFO L93 Difference]: Finished difference Result 659 states and 739 transitions. [2018-04-13 00:01:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 00:01:32,558 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 3553 [2018-04-13 00:01:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:32,561 INFO L225 Difference]: With dead ends: 659 [2018-04-13 00:01:32,561 INFO L226 Difference]: Without dead ends: 659 [2018-04-13 00:01:32,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 00:01:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-04-13 00:01:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 654. [2018-04-13 00:01:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-04-13 00:01:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 733 transitions. [2018-04-13 00:01:32,566 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 733 transitions. Word has length 3553 [2018-04-13 00:01:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:32,566 INFO L459 AbstractCegarLoop]: Abstraction has 654 states and 733 transitions. [2018-04-13 00:01:32,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-13 00:01:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 733 transitions. [2018-04-13 00:01:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3601 [2018-04-13 00:01:32,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:32,614 INFO L355 BasicCegarLoop]: trace histogram [228, 228, 151, 151, 151, 151, 151, 151, 151, 151, 151, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:01:32,614 INFO L408 AbstractCegarLoop]: === Iteration 98 === [__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-13 00:01:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash -972527859, now seen corresponding path program 75 times [2018-04-13 00:01:32,614 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:32,881 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 244235 backedges. 0 proven. 20636 refuted. 0 times theorem prover too weak. 223599 trivial. 0 not checked. [2018-04-13 00:01:37,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:37,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-13 00:01:37,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 111000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111000 trivial. 0 not checked. [2018-04-13 00:01:37,920 INFO L182 omatonBuilderFactory]: Interpolants [68131#true, 68133#(= main_~i~2 0), 68132#false, 68135#(<= main_~i~2 2), 68134#(<= main_~i~2 1), 68137#(<= main_~i~2 4), 68136#(<= main_~i~2 3), 68139#(<= main_~i~2 6), 68138#(<= main_~i~2 5), 68141#(<= main_~i~2 8), 68140#(<= main_~i~2 7), 68143#(<= main_~i~2 10), 68142#(<= main_~i~2 9), 68145#(<= main_~i~2 12), 68144#(<= main_~i~2 11), 68147#(<= main_~i~2 14), 68146#(<= main_~i~2 13), 68149#(<= main_~i~2 16), 68148#(<= main_~i~2 15), 68151#(<= main_~i~2 18), 68150#(<= main_~i~2 17), 68153#(<= main_~i~2 20), 68152#(<= main_~i~2 19), 68155#(<= main_~i~2 22), 68154#(<= main_~i~2 21), 68157#(<= main_~i~2 24), 68156#(<= main_~i~2 23), 68159#(<= main_~i~2 26), 68158#(<= main_~i~2 25), 68161#(<= main_~i~2 28), 68160#(<= main_~i~2 27), 68163#(<= main_~i~2 30), 68162#(<= main_~i~2 29), 68165#(<= main_~i~2 32), 68164#(<= main_~i~2 31), 68167#(<= main_~i~2 34), 68166#(<= main_~i~2 33), 68169#(<= main_~i~2 36), 68168#(<= main_~i~2 35), 68171#(<= main_~i~2 38), 68170#(<= main_~i~2 37), 68173#(<= main_~i~2 40), 68172#(<= main_~i~2 39), 68175#(<= main_~i~2 42), 68174#(<= main_~i~2 41), 68177#(<= main_~i~2 44), 68176#(<= main_~i~2 43), 68179#(<= main_~i~2 46), 68178#(<= main_~i~2 45), 68181#(<= main_~i~2 48), 68180#(<= main_~i~2 47), 68183#(<= main_~i~2 50), 68182#(<= main_~i~2 49), 68185#(<= main_~i~2 52), 68184#(<= main_~i~2 51), 68187#(<= main_~i~2 54), 68186#(<= main_~i~2 53), 68189#(<= main_~i~2 56), 68188#(<= main_~i~2 55), 68191#(<= main_~i~2 58), 68190#(<= main_~i~2 57), 68193#(<= main_~i~2 60), 68192#(<= main_~i~2 59), 68195#(<= main_~i~2 62), 68194#(<= main_~i~2 61), 68197#(<= main_~i~2 64), 68196#(<= main_~i~2 63), 68199#(<= main_~i~2 66), 68198#(<= main_~i~2 65), 68201#(<= main_~i~2 68), 68200#(<= main_~i~2 67), 68203#(<= main_~i~2 70), 68202#(<= main_~i~2 69), 68205#(<= main_~i~2 72), 68204#(<= main_~i~2 71), 68207#(<= main_~i~2 74), 68206#(<= main_~i~2 73), 68209#(<= main_~i~2 76), 68208#(<= main_~i~2 75), 68210#(<= main_~i~2 77)] [2018-04-13 00:01:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 244235 backedges. 0 proven. 20636 refuted. 0 times theorem prover too weak. 223599 trivial. 0 not checked. [2018-04-13 00:01:37,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 00:01:37,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 00:01:37,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 00:01:37,923 INFO L87 Difference]: Start difference. First operand 654 states and 733 transitions. Second operand 80 states. [2018-04-13 00:01:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:38,679 INFO L93 Difference]: Finished difference Result 666 states and 747 transitions. [2018-04-13 00:01:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 00:01:38,907 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 3600 [2018-04-13 00:01:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:38,909 INFO L225 Difference]: With dead ends: 666 [2018-04-13 00:01:38,909 INFO L226 Difference]: Without dead ends: 666 [2018-04-13 00:01:38,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 00:01:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-04-13 00:01:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 661. [2018-04-13 00:01:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-04-13 00:01:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 741 transitions. [2018-04-13 00:01:38,914 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 741 transitions. Word has length 3600 [2018-04-13 00:01:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:38,915 INFO L459 AbstractCegarLoop]: Abstraction has 661 states and 741 transitions. [2018-04-13 00:01:38,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 00:01:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 741 transitions. [2018-04-13 00:01:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3648 [2018-04-13 00:01:38,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:38,960 INFO L355 BasicCegarLoop]: trace histogram [231, 231, 153, 153, 153, 153, 153, 153, 153, 153, 153, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:01:38,960 INFO L408 AbstractCegarLoop]: === Iteration 99 === [__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-13 00:01:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1477740211, now seen corresponding path program 76 times [2018-04-13 00:01:38,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:39,251 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 250721 backedges. 0 proven. 21177 refuted. 0 times theorem prover too weak. 229544 trivial. 0 not checked. [2018-04-13 00:01:44,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:44,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 00:01:44,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 114000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114000 trivial. 0 not checked. [2018-04-13 00:01:44,478 INFO L182 omatonBuilderFactory]: Interpolants [69539#false, 69538#true, 69541#(<= main_~i~2 1), 69540#(= main_~i~2 0), 69543#(<= main_~i~2 3), 69542#(<= main_~i~2 2), 69545#(<= main_~i~2 5), 69544#(<= main_~i~2 4), 69547#(<= main_~i~2 7), 69546#(<= main_~i~2 6), 69549#(<= main_~i~2 9), 69548#(<= main_~i~2 8), 69551#(<= main_~i~2 11), 69550#(<= main_~i~2 10), 69553#(<= main_~i~2 13), 69552#(<= main_~i~2 12), 69555#(<= main_~i~2 15), 69554#(<= main_~i~2 14), 69557#(<= main_~i~2 17), 69556#(<= main_~i~2 16), 69559#(<= main_~i~2 19), 69558#(<= main_~i~2 18), 69561#(<= main_~i~2 21), 69560#(<= main_~i~2 20), 69563#(<= main_~i~2 23), 69562#(<= main_~i~2 22), 69565#(<= main_~i~2 25), 69564#(<= main_~i~2 24), 69567#(<= main_~i~2 27), 69566#(<= main_~i~2 26), 69569#(<= main_~i~2 29), 69568#(<= main_~i~2 28), 69571#(<= main_~i~2 31), 69570#(<= main_~i~2 30), 69573#(<= main_~i~2 33), 69572#(<= main_~i~2 32), 69575#(<= main_~i~2 35), 69574#(<= main_~i~2 34), 69577#(<= main_~i~2 37), 69576#(<= main_~i~2 36), 69579#(<= main_~i~2 39), 69578#(<= main_~i~2 38), 69581#(<= main_~i~2 41), 69580#(<= main_~i~2 40), 69583#(<= main_~i~2 43), 69582#(<= main_~i~2 42), 69585#(<= main_~i~2 45), 69584#(<= main_~i~2 44), 69587#(<= main_~i~2 47), 69586#(<= main_~i~2 46), 69589#(<= main_~i~2 49), 69588#(<= main_~i~2 48), 69591#(<= main_~i~2 51), 69590#(<= main_~i~2 50), 69593#(<= main_~i~2 53), 69592#(<= main_~i~2 52), 69595#(<= main_~i~2 55), 69594#(<= main_~i~2 54), 69597#(<= main_~i~2 57), 69596#(<= main_~i~2 56), 69599#(<= main_~i~2 59), 69598#(<= main_~i~2 58), 69601#(<= main_~i~2 61), 69600#(<= main_~i~2 60), 69603#(<= main_~i~2 63), 69602#(<= main_~i~2 62), 69605#(<= main_~i~2 65), 69604#(<= main_~i~2 64), 69607#(<= main_~i~2 67), 69606#(<= main_~i~2 66), 69609#(<= main_~i~2 69), 69608#(<= main_~i~2 68), 69611#(<= main_~i~2 71), 69610#(<= main_~i~2 70), 69613#(<= main_~i~2 73), 69612#(<= main_~i~2 72), 69615#(<= main_~i~2 75), 69614#(<= main_~i~2 74), 69617#(<= main_~i~2 77), 69616#(<= main_~i~2 76), 69618#(<= main_~i~2 78)] [2018-04-13 00:01:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 250721 backedges. 0 proven. 21177 refuted. 0 times theorem prover too weak. 229544 trivial. 0 not checked. [2018-04-13 00:01:44,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 00:01:44,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 00:01:44,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 00:01:44,481 INFO L87 Difference]: Start difference. First operand 661 states and 741 transitions. Second operand 81 states. [2018-04-13 00:01:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:45,232 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-04-13 00:01:45,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 00:01:45,232 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 3647 [2018-04-13 00:01:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:45,234 INFO L225 Difference]: With dead ends: 673 [2018-04-13 00:01:45,234 INFO L226 Difference]: Without dead ends: 673 [2018-04-13 00:01:45,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 00:01:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-04-13 00:01:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 668. [2018-04-13 00:01:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-04-13 00:01:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 749 transitions. [2018-04-13 00:01:45,239 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 749 transitions. Word has length 3647 [2018-04-13 00:01:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:45,240 INFO L459 AbstractCegarLoop]: Abstraction has 668 states and 749 transitions. [2018-04-13 00:01:45,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 00:01:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 749 transitions. [2018-04-13 00:01:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3695 [2018-04-13 00:01:45,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:45,286 INFO L355 BasicCegarLoop]: trace histogram [234, 234, 155, 155, 155, 155, 155, 155, 155, 155, 155, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:01:45,286 INFO L408 AbstractCegarLoop]: === Iteration 100 === [__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-13 00:01:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash 528973389, now seen corresponding path program 77 times [2018-04-13 00:01:45,293 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:45,582 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 257292 backedges. 0 proven. 21725 refuted. 0 times theorem prover too weak. 235567 trivial. 0 not checked. [2018-04-13 00:01:50,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:50,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-13 00:01:50,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 117040 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117040 trivial. 0 not checked. [2018-04-13 00:01:50,899 INFO L182 omatonBuilderFactory]: Interpolants [71041#(<= main_~i~2 79), 71040#(<= main_~i~2 78), 70961#false, 70960#true, 70963#(<= main_~i~2 1), 70962#(= main_~i~2 0), 70965#(<= main_~i~2 3), 70964#(<= main_~i~2 2), 70967#(<= main_~i~2 5), 70966#(<= main_~i~2 4), 70969#(<= main_~i~2 7), 70968#(<= main_~i~2 6), 70971#(<= main_~i~2 9), 70970#(<= main_~i~2 8), 70973#(<= main_~i~2 11), 70972#(<= main_~i~2 10), 70975#(<= main_~i~2 13), 70974#(<= main_~i~2 12), 70977#(<= main_~i~2 15), 70976#(<= main_~i~2 14), 70979#(<= main_~i~2 17), 70978#(<= main_~i~2 16), 70981#(<= main_~i~2 19), 70980#(<= main_~i~2 18), 70983#(<= main_~i~2 21), 70982#(<= main_~i~2 20), 70985#(<= main_~i~2 23), 70984#(<= main_~i~2 22), 70987#(<= main_~i~2 25), 70986#(<= main_~i~2 24), 70989#(<= main_~i~2 27), 70988#(<= main_~i~2 26), 70991#(<= main_~i~2 29), 70990#(<= main_~i~2 28), 70993#(<= main_~i~2 31), 70992#(<= main_~i~2 30), 70995#(<= main_~i~2 33), 70994#(<= main_~i~2 32), 70997#(<= main_~i~2 35), 70996#(<= main_~i~2 34), 70999#(<= main_~i~2 37), 70998#(<= main_~i~2 36), 71001#(<= main_~i~2 39), 71000#(<= main_~i~2 38), 71003#(<= main_~i~2 41), 71002#(<= main_~i~2 40), 71005#(<= main_~i~2 43), 71004#(<= main_~i~2 42), 71007#(<= main_~i~2 45), 71006#(<= main_~i~2 44), 71009#(<= main_~i~2 47), 71008#(<= main_~i~2 46), 71011#(<= main_~i~2 49), 71010#(<= main_~i~2 48), 71013#(<= main_~i~2 51), 71012#(<= main_~i~2 50), 71015#(<= main_~i~2 53), 71014#(<= main_~i~2 52), 71017#(<= main_~i~2 55), 71016#(<= main_~i~2 54), 71019#(<= main_~i~2 57), 71018#(<= main_~i~2 56), 71021#(<= main_~i~2 59), 71020#(<= main_~i~2 58), 71023#(<= main_~i~2 61), 71022#(<= main_~i~2 60), 71025#(<= main_~i~2 63), 71024#(<= main_~i~2 62), 71027#(<= main_~i~2 65), 71026#(<= main_~i~2 64), 71029#(<= main_~i~2 67), 71028#(<= main_~i~2 66), 71031#(<= main_~i~2 69), 71030#(<= main_~i~2 68), 71033#(<= main_~i~2 71), 71032#(<= main_~i~2 70), 71035#(<= main_~i~2 73), 71034#(<= main_~i~2 72), 71037#(<= main_~i~2 75), 71036#(<= main_~i~2 74), 71039#(<= main_~i~2 77), 71038#(<= main_~i~2 76)] [2018-04-13 00:01:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 257292 backedges. 0 proven. 21725 refuted. 0 times theorem prover too weak. 235567 trivial. 0 not checked. [2018-04-13 00:01:50,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 00:01:50,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 00:01:50,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 00:01:50,903 INFO L87 Difference]: Start difference. First operand 668 states and 749 transitions. Second operand 82 states. [2018-04-13 00:01:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:51,632 INFO L93 Difference]: Finished difference Result 680 states and 763 transitions. [2018-04-13 00:01:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 00:01:51,632 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 3694 [2018-04-13 00:01:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:51,635 INFO L225 Difference]: With dead ends: 680 [2018-04-13 00:01:51,635 INFO L226 Difference]: Without dead ends: 680 [2018-04-13 00:01:51,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 00:01:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-04-13 00:01:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 675. [2018-04-13 00:01:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-04-13 00:01:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 757 transitions. [2018-04-13 00:01:51,639 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 757 transitions. Word has length 3694 [2018-04-13 00:01:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:51,640 INFO L459 AbstractCegarLoop]: Abstraction has 675 states and 757 transitions. [2018-04-13 00:01:51,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 00:01:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 757 transitions. [2018-04-13 00:01:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3742 [2018-04-13 00:01:51,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:51,689 INFO L355 BasicCegarLoop]: trace histogram [237, 237, 157, 157, 157, 157, 157, 157, 157, 157, 157, 81, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:01:51,689 INFO L408 AbstractCegarLoop]: === Iteration 101 === [__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-13 00:01:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash -739702925, now seen corresponding path program 78 times [2018-04-13 00:01:51,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:51,990 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:01:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 263948 backedges. 0 proven. 22280 refuted. 0 times theorem prover too weak. 241668 trivial. 0 not checked. [2018-04-13 00:01:57,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:01:57,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-13 00:01:57,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:01:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 120120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120120 trivial. 0 not checked. [2018-04-13 00:01:57,464 INFO L182 omatonBuilderFactory]: Interpolants [72449#(<= main_~i~2 50), 72448#(<= main_~i~2 49), 72451#(<= main_~i~2 52), 72450#(<= main_~i~2 51), 72453#(<= main_~i~2 54), 72452#(<= main_~i~2 53), 72455#(<= main_~i~2 56), 72454#(<= main_~i~2 55), 72457#(<= main_~i~2 58), 72456#(<= main_~i~2 57), 72459#(<= main_~i~2 60), 72458#(<= main_~i~2 59), 72461#(<= main_~i~2 62), 72460#(<= main_~i~2 61), 72463#(<= main_~i~2 64), 72462#(<= main_~i~2 63), 72465#(<= main_~i~2 66), 72464#(<= main_~i~2 65), 72467#(<= main_~i~2 68), 72466#(<= main_~i~2 67), 72469#(<= main_~i~2 70), 72468#(<= main_~i~2 69), 72471#(<= main_~i~2 72), 72470#(<= main_~i~2 71), 72473#(<= main_~i~2 74), 72472#(<= main_~i~2 73), 72475#(<= main_~i~2 76), 72474#(<= main_~i~2 75), 72477#(<= main_~i~2 78), 72476#(<= main_~i~2 77), 72479#(<= main_~i~2 80), 72478#(<= main_~i~2 79), 72397#true, 72399#(= main_~i~2 0), 72398#false, 72401#(<= main_~i~2 2), 72400#(<= main_~i~2 1), 72403#(<= main_~i~2 4), 72402#(<= main_~i~2 3), 72405#(<= main_~i~2 6), 72404#(<= main_~i~2 5), 72407#(<= main_~i~2 8), 72406#(<= main_~i~2 7), 72409#(<= main_~i~2 10), 72408#(<= main_~i~2 9), 72411#(<= main_~i~2 12), 72410#(<= main_~i~2 11), 72413#(<= main_~i~2 14), 72412#(<= main_~i~2 13), 72415#(<= main_~i~2 16), 72414#(<= main_~i~2 15), 72417#(<= main_~i~2 18), 72416#(<= main_~i~2 17), 72419#(<= main_~i~2 20), 72418#(<= main_~i~2 19), 72421#(<= main_~i~2 22), 72420#(<= main_~i~2 21), 72423#(<= main_~i~2 24), 72422#(<= main_~i~2 23), 72425#(<= main_~i~2 26), 72424#(<= main_~i~2 25), 72427#(<= main_~i~2 28), 72426#(<= main_~i~2 27), 72429#(<= main_~i~2 30), 72428#(<= main_~i~2 29), 72431#(<= main_~i~2 32), 72430#(<= main_~i~2 31), 72433#(<= main_~i~2 34), 72432#(<= main_~i~2 33), 72435#(<= main_~i~2 36), 72434#(<= main_~i~2 35), 72437#(<= main_~i~2 38), 72436#(<= main_~i~2 37), 72439#(<= main_~i~2 40), 72438#(<= main_~i~2 39), 72441#(<= main_~i~2 42), 72440#(<= main_~i~2 41), 72443#(<= main_~i~2 44), 72442#(<= main_~i~2 43), 72445#(<= main_~i~2 46), 72444#(<= main_~i~2 45), 72447#(<= main_~i~2 48), 72446#(<= main_~i~2 47)] [2018-04-13 00:01:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 263948 backedges. 0 proven. 22280 refuted. 0 times theorem prover too weak. 241668 trivial. 0 not checked. [2018-04-13 00:01:57,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 00:01:57,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 00:01:57,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 00:01:57,468 INFO L87 Difference]: Start difference. First operand 675 states and 757 transitions. Second operand 83 states. [2018-04-13 00:01:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:01:57,963 INFO L93 Difference]: Finished difference Result 687 states and 771 transitions. [2018-04-13 00:01:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 00:01:57,963 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 3741 [2018-04-13 00:01:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:01:57,965 INFO L225 Difference]: With dead ends: 687 [2018-04-13 00:01:57,965 INFO L226 Difference]: Without dead ends: 687 [2018-04-13 00:01:57,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 00:01:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-13 00:01:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 682. [2018-04-13 00:01:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-04-13 00:01:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 765 transitions. [2018-04-13 00:01:57,970 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 765 transitions. Word has length 3741 [2018-04-13 00:01:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:01:57,971 INFO L459 AbstractCegarLoop]: Abstraction has 682 states and 765 transitions. [2018-04-13 00:01:57,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 00:01:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 765 transitions. [2018-04-13 00:01:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3789 [2018-04-13 00:01:58,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:01:58,019 INFO L355 BasicCegarLoop]: trace histogram [240, 240, 159, 159, 159, 159, 159, 159, 159, 159, 159, 82, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:01:58,019 INFO L408 AbstractCegarLoop]: === Iteration 102 === [__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-13 00:01:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash -98802291, now seen corresponding path program 79 times [2018-04-13 00:01:58,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:01:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:01:58,346 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 270689 backedges. 0 proven. 22842 refuted. 0 times theorem prover too weak. 247847 trivial. 0 not checked. [2018-04-13 00:02:05,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:05,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-13 00:02:05,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 123240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123240 trivial. 0 not checked. [2018-04-13 00:02:05,156 INFO L182 omatonBuilderFactory]: Interpolants [73857#(<= main_~i~2 6), 73856#(<= main_~i~2 5), 73859#(<= main_~i~2 8), 73858#(<= main_~i~2 7), 73861#(<= main_~i~2 10), 73860#(<= main_~i~2 9), 73863#(<= main_~i~2 12), 73862#(<= main_~i~2 11), 73865#(<= main_~i~2 14), 73864#(<= main_~i~2 13), 73867#(<= main_~i~2 16), 73866#(<= main_~i~2 15), 73869#(<= main_~i~2 18), 73868#(<= main_~i~2 17), 73871#(<= main_~i~2 20), 73870#(<= main_~i~2 19), 73873#(<= main_~i~2 22), 73872#(<= main_~i~2 21), 73875#(<= main_~i~2 24), 73874#(<= main_~i~2 23), 73877#(<= main_~i~2 26), 73876#(<= main_~i~2 25), 73879#(<= main_~i~2 28), 73878#(<= main_~i~2 27), 73881#(<= main_~i~2 30), 73880#(<= main_~i~2 29), 73883#(<= main_~i~2 32), 73882#(<= main_~i~2 31), 73885#(<= main_~i~2 34), 73884#(<= main_~i~2 33), 73887#(<= main_~i~2 36), 73886#(<= main_~i~2 35), 73889#(<= main_~i~2 38), 73888#(<= main_~i~2 37), 73891#(<= main_~i~2 40), 73890#(<= main_~i~2 39), 73893#(<= main_~i~2 42), 73892#(<= main_~i~2 41), 73895#(<= main_~i~2 44), 73894#(<= main_~i~2 43), 73897#(<= main_~i~2 46), 73896#(<= main_~i~2 45), 73899#(<= main_~i~2 48), 73898#(<= main_~i~2 47), 73901#(<= main_~i~2 50), 73900#(<= main_~i~2 49), 73903#(<= main_~i~2 52), 73902#(<= main_~i~2 51), 73905#(<= main_~i~2 54), 73904#(<= main_~i~2 53), 73907#(<= main_~i~2 56), 73906#(<= main_~i~2 55), 73909#(<= main_~i~2 58), 73908#(<= main_~i~2 57), 73911#(<= main_~i~2 60), 73910#(<= main_~i~2 59), 73913#(<= main_~i~2 62), 73912#(<= main_~i~2 61), 73915#(<= main_~i~2 64), 73914#(<= main_~i~2 63), 73917#(<= main_~i~2 66), 73916#(<= main_~i~2 65), 73919#(<= main_~i~2 68), 73918#(<= main_~i~2 67), 73921#(<= main_~i~2 70), 73920#(<= main_~i~2 69), 73923#(<= main_~i~2 72), 73922#(<= main_~i~2 71), 73925#(<= main_~i~2 74), 73924#(<= main_~i~2 73), 73927#(<= main_~i~2 76), 73926#(<= main_~i~2 75), 73929#(<= main_~i~2 78), 73928#(<= main_~i~2 77), 73931#(<= main_~i~2 80), 73930#(<= main_~i~2 79), 73932#(<= main_~i~2 81), 73849#true, 73851#(= main_~i~2 0), 73850#false, 73853#(<= main_~i~2 2), 73852#(<= main_~i~2 1), 73855#(<= main_~i~2 4), 73854#(<= main_~i~2 3)] [2018-04-13 00:02:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 270689 backedges. 0 proven. 22842 refuted. 0 times theorem prover too weak. 247847 trivial. 0 not checked. [2018-04-13 00:02:05,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 00:02:05,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 00:02:05,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 00:02:05,160 INFO L87 Difference]: Start difference. First operand 682 states and 765 transitions. Second operand 84 states. [2018-04-13 00:02:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:05,917 INFO L93 Difference]: Finished difference Result 694 states and 779 transitions. [2018-04-13 00:02:05,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 00:02:05,918 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 3788 [2018-04-13 00:02:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:05,920 INFO L225 Difference]: With dead ends: 694 [2018-04-13 00:02:05,920 INFO L226 Difference]: Without dead ends: 694 [2018-04-13 00:02:05,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 00:02:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-13 00:02:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 689. [2018-04-13 00:02:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-04-13 00:02:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 773 transitions. [2018-04-13 00:02:05,925 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 773 transitions. Word has length 3788 [2018-04-13 00:02:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:05,926 INFO L459 AbstractCegarLoop]: Abstraction has 689 states and 773 transitions. [2018-04-13 00:02:05,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 00:02:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 773 transitions. [2018-04-13 00:02:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3836 [2018-04-13 00:02:05,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:05,975 INFO L355 BasicCegarLoop]: trace histogram [243, 243, 161, 161, 161, 161, 161, 161, 161, 161, 161, 83, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:05,975 INFO L408 AbstractCegarLoop]: === Iteration 103 === [__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-13 00:02:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1718765517, now seen corresponding path program 80 times [2018-04-13 00:02:05,976 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:06,293 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 277515 backedges. 0 proven. 23411 refuted. 0 times theorem prover too weak. 254104 trivial. 0 not checked. [2018-04-13 00:02:11,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:11,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-13 00:02:11,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 126400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126400 trivial. 0 not checked. [2018-04-13 00:02:11,901 INFO L182 omatonBuilderFactory]: Interpolants [75393#(<= main_~i~2 75), 75392#(<= main_~i~2 74), 75395#(<= main_~i~2 77), 75394#(<= main_~i~2 76), 75397#(<= main_~i~2 79), 75396#(<= main_~i~2 78), 75399#(<= main_~i~2 81), 75398#(<= main_~i~2 80), 75400#(<= main_~i~2 82), 75317#false, 75316#true, 75319#(<= main_~i~2 1), 75318#(= main_~i~2 0), 75321#(<= main_~i~2 3), 75320#(<= main_~i~2 2), 75323#(<= main_~i~2 5), 75322#(<= main_~i~2 4), 75325#(<= main_~i~2 7), 75324#(<= main_~i~2 6), 75327#(<= main_~i~2 9), 75326#(<= main_~i~2 8), 75329#(<= main_~i~2 11), 75328#(<= main_~i~2 10), 75331#(<= main_~i~2 13), 75330#(<= main_~i~2 12), 75333#(<= main_~i~2 15), 75332#(<= main_~i~2 14), 75335#(<= main_~i~2 17), 75334#(<= main_~i~2 16), 75337#(<= main_~i~2 19), 75336#(<= main_~i~2 18), 75339#(<= main_~i~2 21), 75338#(<= main_~i~2 20), 75341#(<= main_~i~2 23), 75340#(<= main_~i~2 22), 75343#(<= main_~i~2 25), 75342#(<= main_~i~2 24), 75345#(<= main_~i~2 27), 75344#(<= main_~i~2 26), 75347#(<= main_~i~2 29), 75346#(<= main_~i~2 28), 75349#(<= main_~i~2 31), 75348#(<= main_~i~2 30), 75351#(<= main_~i~2 33), 75350#(<= main_~i~2 32), 75353#(<= main_~i~2 35), 75352#(<= main_~i~2 34), 75355#(<= main_~i~2 37), 75354#(<= main_~i~2 36), 75357#(<= main_~i~2 39), 75356#(<= main_~i~2 38), 75359#(<= main_~i~2 41), 75358#(<= main_~i~2 40), 75361#(<= main_~i~2 43), 75360#(<= main_~i~2 42), 75363#(<= main_~i~2 45), 75362#(<= main_~i~2 44), 75365#(<= main_~i~2 47), 75364#(<= main_~i~2 46), 75367#(<= main_~i~2 49), 75366#(<= main_~i~2 48), 75369#(<= main_~i~2 51), 75368#(<= main_~i~2 50), 75371#(<= main_~i~2 53), 75370#(<= main_~i~2 52), 75373#(<= main_~i~2 55), 75372#(<= main_~i~2 54), 75375#(<= main_~i~2 57), 75374#(<= main_~i~2 56), 75377#(<= main_~i~2 59), 75376#(<= main_~i~2 58), 75379#(<= main_~i~2 61), 75378#(<= main_~i~2 60), 75381#(<= main_~i~2 63), 75380#(<= main_~i~2 62), 75383#(<= main_~i~2 65), 75382#(<= main_~i~2 64), 75385#(<= main_~i~2 67), 75384#(<= main_~i~2 66), 75387#(<= main_~i~2 69), 75386#(<= main_~i~2 68), 75389#(<= main_~i~2 71), 75388#(<= main_~i~2 70), 75391#(<= main_~i~2 73), 75390#(<= main_~i~2 72)] [2018-04-13 00:02:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 277515 backedges. 0 proven. 23411 refuted. 0 times theorem prover too weak. 254104 trivial. 0 not checked. [2018-04-13 00:02:11,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 00:02:11,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 00:02:11,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 00:02:11,905 INFO L87 Difference]: Start difference. First operand 689 states and 773 transitions. Second operand 85 states. [2018-04-13 00:02:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:12,612 INFO L93 Difference]: Finished difference Result 701 states and 787 transitions. [2018-04-13 00:02:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 00:02:12,612 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 3835 [2018-04-13 00:02:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:12,615 INFO L225 Difference]: With dead ends: 701 [2018-04-13 00:02:12,615 INFO L226 Difference]: Without dead ends: 701 [2018-04-13 00:02:12,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 00:02:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-13 00:02:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 696. [2018-04-13 00:02:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-04-13 00:02:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 781 transitions. [2018-04-13 00:02:12,620 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 781 transitions. Word has length 3835 [2018-04-13 00:02:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:12,621 INFO L459 AbstractCegarLoop]: Abstraction has 696 states and 781 transitions. [2018-04-13 00:02:12,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 00:02:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 781 transitions. [2018-04-13 00:02:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3883 [2018-04-13 00:02:12,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:12,673 INFO L355 BasicCegarLoop]: trace histogram [246, 246, 163, 163, 163, 163, 163, 163, 163, 163, 163, 84, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:12,673 INFO L408 AbstractCegarLoop]: === Iteration 104 === [__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-13 00:02:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -281338675, now seen corresponding path program 81 times [2018-04-13 00:02:12,673 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:13,017 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 284426 backedges. 0 proven. 23987 refuted. 0 times theorem prover too weak. 260439 trivial. 0 not checked. [2018-04-13 00:02:18,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:18,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-13 00:02:18,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 129600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 129600 trivial. 0 not checked. [2018-04-13 00:02:18,868 INFO L182 omatonBuilderFactory]: Interpolants [76801#(<= main_~i~2 1), 76800#(= main_~i~2 0), 76803#(<= main_~i~2 3), 76802#(<= main_~i~2 2), 76805#(<= main_~i~2 5), 76804#(<= main_~i~2 4), 76807#(<= main_~i~2 7), 76806#(<= main_~i~2 6), 76809#(<= main_~i~2 9), 76808#(<= main_~i~2 8), 76811#(<= main_~i~2 11), 76810#(<= main_~i~2 10), 76813#(<= main_~i~2 13), 76812#(<= main_~i~2 12), 76815#(<= main_~i~2 15), 76814#(<= main_~i~2 14), 76817#(<= main_~i~2 17), 76816#(<= main_~i~2 16), 76819#(<= main_~i~2 19), 76818#(<= main_~i~2 18), 76821#(<= main_~i~2 21), 76820#(<= main_~i~2 20), 76823#(<= main_~i~2 23), 76822#(<= main_~i~2 22), 76825#(<= main_~i~2 25), 76824#(<= main_~i~2 24), 76827#(<= main_~i~2 27), 76826#(<= main_~i~2 26), 76829#(<= main_~i~2 29), 76828#(<= main_~i~2 28), 76831#(<= main_~i~2 31), 76830#(<= main_~i~2 30), 76833#(<= main_~i~2 33), 76832#(<= main_~i~2 32), 76835#(<= main_~i~2 35), 76834#(<= main_~i~2 34), 76837#(<= main_~i~2 37), 76836#(<= main_~i~2 36), 76839#(<= main_~i~2 39), 76838#(<= main_~i~2 38), 76841#(<= main_~i~2 41), 76840#(<= main_~i~2 40), 76843#(<= main_~i~2 43), 76842#(<= main_~i~2 42), 76845#(<= main_~i~2 45), 76844#(<= main_~i~2 44), 76847#(<= main_~i~2 47), 76846#(<= main_~i~2 46), 76849#(<= main_~i~2 49), 76848#(<= main_~i~2 48), 76851#(<= main_~i~2 51), 76850#(<= main_~i~2 50), 76853#(<= main_~i~2 53), 76852#(<= main_~i~2 52), 76855#(<= main_~i~2 55), 76854#(<= main_~i~2 54), 76857#(<= main_~i~2 57), 76856#(<= main_~i~2 56), 76859#(<= main_~i~2 59), 76858#(<= main_~i~2 58), 76861#(<= main_~i~2 61), 76860#(<= main_~i~2 60), 76863#(<= main_~i~2 63), 76862#(<= main_~i~2 62), 76865#(<= main_~i~2 65), 76864#(<= main_~i~2 64), 76867#(<= main_~i~2 67), 76866#(<= main_~i~2 66), 76869#(<= main_~i~2 69), 76868#(<= main_~i~2 68), 76871#(<= main_~i~2 71), 76870#(<= main_~i~2 70), 76873#(<= main_~i~2 73), 76872#(<= main_~i~2 72), 76875#(<= main_~i~2 75), 76874#(<= main_~i~2 74), 76877#(<= main_~i~2 77), 76876#(<= main_~i~2 76), 76879#(<= main_~i~2 79), 76878#(<= main_~i~2 78), 76881#(<= main_~i~2 81), 76880#(<= main_~i~2 80), 76883#(<= main_~i~2 83), 76882#(<= main_~i~2 82), 76799#false, 76798#true] [2018-04-13 00:02:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 284426 backedges. 0 proven. 23987 refuted. 0 times theorem prover too weak. 260439 trivial. 0 not checked. [2018-04-13 00:02:18,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 00:02:18,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 00:02:18,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 00:02:18,872 INFO L87 Difference]: Start difference. First operand 696 states and 781 transitions. Second operand 86 states. [2018-04-13 00:02:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:19,739 INFO L93 Difference]: Finished difference Result 708 states and 795 transitions. [2018-04-13 00:02:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 00:02:19,739 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 3882 [2018-04-13 00:02:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:19,742 INFO L225 Difference]: With dead ends: 708 [2018-04-13 00:02:19,742 INFO L226 Difference]: Without dead ends: 708 [2018-04-13 00:02:19,742 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 00:02:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-13 00:02:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 703. [2018-04-13 00:02:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-04-13 00:02:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 789 transitions. [2018-04-13 00:02:19,747 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 789 transitions. Word has length 3882 [2018-04-13 00:02:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:19,748 INFO L459 AbstractCegarLoop]: Abstraction has 703 states and 789 transitions. [2018-04-13 00:02:19,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 00:02:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 789 transitions. [2018-04-13 00:02:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3930 [2018-04-13 00:02:19,802 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:19,802 INFO L355 BasicCegarLoop]: trace histogram [249, 249, 165, 165, 165, 165, 165, 165, 165, 165, 165, 85, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:19,802 INFO L408 AbstractCegarLoop]: === Iteration 105 === [__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-13 00:02:19,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1225693427, now seen corresponding path program 82 times [2018-04-13 00:02:19,803 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:20,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 291422 backedges. 0 proven. 24570 refuted. 0 times theorem prover too weak. 266852 trivial. 0 not checked. [2018-04-13 00:02:26,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:26,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 00:02:26,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 132840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132840 trivial. 0 not checked. [2018-04-13 00:02:26,064 INFO L182 omatonBuilderFactory]: Interpolants [78337#(<= main_~i~2 40), 78336#(<= main_~i~2 39), 78339#(<= main_~i~2 42), 78338#(<= main_~i~2 41), 78341#(<= main_~i~2 44), 78340#(<= main_~i~2 43), 78343#(<= main_~i~2 46), 78342#(<= main_~i~2 45), 78345#(<= main_~i~2 48), 78344#(<= main_~i~2 47), 78347#(<= main_~i~2 50), 78346#(<= main_~i~2 49), 78349#(<= main_~i~2 52), 78348#(<= main_~i~2 51), 78351#(<= main_~i~2 54), 78350#(<= main_~i~2 53), 78353#(<= main_~i~2 56), 78352#(<= main_~i~2 55), 78355#(<= main_~i~2 58), 78354#(<= main_~i~2 57), 78357#(<= main_~i~2 60), 78356#(<= main_~i~2 59), 78359#(<= main_~i~2 62), 78358#(<= main_~i~2 61), 78361#(<= main_~i~2 64), 78360#(<= main_~i~2 63), 78363#(<= main_~i~2 66), 78362#(<= main_~i~2 65), 78365#(<= main_~i~2 68), 78364#(<= main_~i~2 67), 78367#(<= main_~i~2 70), 78366#(<= main_~i~2 69), 78369#(<= main_~i~2 72), 78368#(<= main_~i~2 71), 78371#(<= main_~i~2 74), 78370#(<= main_~i~2 73), 78373#(<= main_~i~2 76), 78372#(<= main_~i~2 75), 78375#(<= main_~i~2 78), 78374#(<= main_~i~2 77), 78377#(<= main_~i~2 80), 78376#(<= main_~i~2 79), 78379#(<= main_~i~2 82), 78378#(<= main_~i~2 81), 78381#(<= main_~i~2 84), 78380#(<= main_~i~2 83), 78295#true, 78297#(= main_~i~2 0), 78296#false, 78299#(<= main_~i~2 2), 78298#(<= main_~i~2 1), 78301#(<= main_~i~2 4), 78300#(<= main_~i~2 3), 78303#(<= main_~i~2 6), 78302#(<= main_~i~2 5), 78305#(<= main_~i~2 8), 78304#(<= main_~i~2 7), 78307#(<= main_~i~2 10), 78306#(<= main_~i~2 9), 78309#(<= main_~i~2 12), 78308#(<= main_~i~2 11), 78311#(<= main_~i~2 14), 78310#(<= main_~i~2 13), 78313#(<= main_~i~2 16), 78312#(<= main_~i~2 15), 78315#(<= main_~i~2 18), 78314#(<= main_~i~2 17), 78317#(<= main_~i~2 20), 78316#(<= main_~i~2 19), 78319#(<= main_~i~2 22), 78318#(<= main_~i~2 21), 78321#(<= main_~i~2 24), 78320#(<= main_~i~2 23), 78323#(<= main_~i~2 26), 78322#(<= main_~i~2 25), 78325#(<= main_~i~2 28), 78324#(<= main_~i~2 27), 78327#(<= main_~i~2 30), 78326#(<= main_~i~2 29), 78329#(<= main_~i~2 32), 78328#(<= main_~i~2 31), 78331#(<= main_~i~2 34), 78330#(<= main_~i~2 33), 78333#(<= main_~i~2 36), 78332#(<= main_~i~2 35), 78335#(<= main_~i~2 38), 78334#(<= main_~i~2 37)] [2018-04-13 00:02:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 291422 backedges. 0 proven. 24570 refuted. 0 times theorem prover too weak. 266852 trivial. 0 not checked. [2018-04-13 00:02:26,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 00:02:26,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 00:02:26,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 00:02:26,067 INFO L87 Difference]: Start difference. First operand 703 states and 789 transitions. Second operand 87 states. [2018-04-13 00:02:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:26,616 INFO L93 Difference]: Finished difference Result 715 states and 803 transitions. [2018-04-13 00:02:26,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 00:02:26,616 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 3929 [2018-04-13 00:02:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:26,619 INFO L225 Difference]: With dead ends: 715 [2018-04-13 00:02:26,619 INFO L226 Difference]: Without dead ends: 715 [2018-04-13 00:02:26,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 00:02:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-04-13 00:02:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 710. [2018-04-13 00:02:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-04-13 00:02:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 797 transitions. [2018-04-13 00:02:26,627 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 797 transitions. Word has length 3929 [2018-04-13 00:02:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:26,629 INFO L459 AbstractCegarLoop]: Abstraction has 710 states and 797 transitions. [2018-04-13 00:02:26,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 00:02:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 797 transitions. [2018-04-13 00:02:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3977 [2018-04-13 00:02:26,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:26,717 INFO L355 BasicCegarLoop]: trace histogram [252, 252, 167, 167, 167, 167, 167, 167, 167, 167, 167, 86, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:26,717 INFO L408 AbstractCegarLoop]: === Iteration 106 === [__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-13 00:02:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -178805747, now seen corresponding path program 83 times [2018-04-13 00:02:26,718 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:27,068 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 298503 backedges. 0 proven. 25160 refuted. 0 times theorem prover too weak. 273343 trivial. 0 not checked. [2018-04-13 00:02:33,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:33,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-13 00:02:33,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 136120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136120 trivial. 0 not checked. [2018-04-13 00:02:33,131 INFO L182 omatonBuilderFactory]: Interpolants [79873#(<= main_~i~2 64), 79872#(<= main_~i~2 63), 79875#(<= main_~i~2 66), 79874#(<= main_~i~2 65), 79877#(<= main_~i~2 68), 79876#(<= main_~i~2 67), 79879#(<= main_~i~2 70), 79878#(<= main_~i~2 69), 79881#(<= main_~i~2 72), 79880#(<= main_~i~2 71), 79883#(<= main_~i~2 74), 79882#(<= main_~i~2 73), 79885#(<= main_~i~2 76), 79884#(<= main_~i~2 75), 79887#(<= main_~i~2 78), 79886#(<= main_~i~2 77), 79889#(<= main_~i~2 80), 79888#(<= main_~i~2 79), 79891#(<= main_~i~2 82), 79890#(<= main_~i~2 81), 79893#(<= main_~i~2 84), 79892#(<= main_~i~2 83), 79894#(<= main_~i~2 85), 79807#true, 79809#(= main_~i~2 0), 79808#false, 79811#(<= main_~i~2 2), 79810#(<= main_~i~2 1), 79813#(<= main_~i~2 4), 79812#(<= main_~i~2 3), 79815#(<= main_~i~2 6), 79814#(<= main_~i~2 5), 79817#(<= main_~i~2 8), 79816#(<= main_~i~2 7), 79819#(<= main_~i~2 10), 79818#(<= main_~i~2 9), 79821#(<= main_~i~2 12), 79820#(<= main_~i~2 11), 79823#(<= main_~i~2 14), 79822#(<= main_~i~2 13), 79825#(<= main_~i~2 16), 79824#(<= main_~i~2 15), 79827#(<= main_~i~2 18), 79826#(<= main_~i~2 17), 79829#(<= main_~i~2 20), 79828#(<= main_~i~2 19), 79831#(<= main_~i~2 22), 79830#(<= main_~i~2 21), 79833#(<= main_~i~2 24), 79832#(<= main_~i~2 23), 79835#(<= main_~i~2 26), 79834#(<= main_~i~2 25), 79837#(<= main_~i~2 28), 79836#(<= main_~i~2 27), 79839#(<= main_~i~2 30), 79838#(<= main_~i~2 29), 79841#(<= main_~i~2 32), 79840#(<= main_~i~2 31), 79843#(<= main_~i~2 34), 79842#(<= main_~i~2 33), 79845#(<= main_~i~2 36), 79844#(<= main_~i~2 35), 79847#(<= main_~i~2 38), 79846#(<= main_~i~2 37), 79849#(<= main_~i~2 40), 79848#(<= main_~i~2 39), 79851#(<= main_~i~2 42), 79850#(<= main_~i~2 41), 79853#(<= main_~i~2 44), 79852#(<= main_~i~2 43), 79855#(<= main_~i~2 46), 79854#(<= main_~i~2 45), 79857#(<= main_~i~2 48), 79856#(<= main_~i~2 47), 79859#(<= main_~i~2 50), 79858#(<= main_~i~2 49), 79861#(<= main_~i~2 52), 79860#(<= main_~i~2 51), 79863#(<= main_~i~2 54), 79862#(<= main_~i~2 53), 79865#(<= main_~i~2 56), 79864#(<= main_~i~2 55), 79867#(<= main_~i~2 58), 79866#(<= main_~i~2 57), 79869#(<= main_~i~2 60), 79868#(<= main_~i~2 59), 79871#(<= main_~i~2 62), 79870#(<= main_~i~2 61)] [2018-04-13 00:02:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 298503 backedges. 0 proven. 25160 refuted. 0 times theorem prover too weak. 273343 trivial. 0 not checked. [2018-04-13 00:02:33,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 00:02:33,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 00:02:33,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 00:02:33,135 INFO L87 Difference]: Start difference. First operand 710 states and 797 transitions. Second operand 88 states. [2018-04-13 00:02:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:33,764 INFO L93 Difference]: Finished difference Result 722 states and 811 transitions. [2018-04-13 00:02:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 00:02:33,764 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 3976 [2018-04-13 00:02:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:33,767 INFO L225 Difference]: With dead ends: 722 [2018-04-13 00:02:33,767 INFO L226 Difference]: Without dead ends: 722 [2018-04-13 00:02:33,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 00:02:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-04-13 00:02:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 717. [2018-04-13 00:02:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-04-13 00:02:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 805 transitions. [2018-04-13 00:02:33,772 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 805 transitions. Word has length 3976 [2018-04-13 00:02:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:33,773 INFO L459 AbstractCegarLoop]: Abstraction has 717 states and 805 transitions. [2018-04-13 00:02:33,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 00:02:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 805 transitions. [2018-04-13 00:02:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4024 [2018-04-13 00:02:33,838 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:33,838 INFO L355 BasicCegarLoop]: trace histogram [255, 255, 169, 169, 169, 169, 169, 169, 169, 169, 169, 87, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:33,838 INFO L408 AbstractCegarLoop]: === Iteration 107 === [__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-13 00:02:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2055755341, now seen corresponding path program 84 times [2018-04-13 00:02:33,839 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:34,209 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 305669 backedges. 0 proven. 25757 refuted. 0 times theorem prover too weak. 279912 trivial. 0 not checked. [2018-04-13 00:02:40,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:40,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-13 00:02:40,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 139440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139440 trivial. 0 not checked. [2018-04-13 00:02:40,474 INFO L182 omatonBuilderFactory]: Interpolants [81409#(<= main_~i~2 73), 81408#(<= main_~i~2 72), 81411#(<= main_~i~2 75), 81410#(<= main_~i~2 74), 81413#(<= main_~i~2 77), 81412#(<= main_~i~2 76), 81415#(<= main_~i~2 79), 81414#(<= main_~i~2 78), 81417#(<= main_~i~2 81), 81416#(<= main_~i~2 80), 81419#(<= main_~i~2 83), 81418#(<= main_~i~2 82), 81421#(<= main_~i~2 85), 81420#(<= main_~i~2 84), 81422#(<= main_~i~2 86), 81335#false, 81334#true, 81337#(<= main_~i~2 1), 81336#(= main_~i~2 0), 81339#(<= main_~i~2 3), 81338#(<= main_~i~2 2), 81341#(<= main_~i~2 5), 81340#(<= main_~i~2 4), 81343#(<= main_~i~2 7), 81342#(<= main_~i~2 6), 81345#(<= main_~i~2 9), 81344#(<= main_~i~2 8), 81347#(<= main_~i~2 11), 81346#(<= main_~i~2 10), 81349#(<= main_~i~2 13), 81348#(<= main_~i~2 12), 81351#(<= main_~i~2 15), 81350#(<= main_~i~2 14), 81353#(<= main_~i~2 17), 81352#(<= main_~i~2 16), 81355#(<= main_~i~2 19), 81354#(<= main_~i~2 18), 81357#(<= main_~i~2 21), 81356#(<= main_~i~2 20), 81359#(<= main_~i~2 23), 81358#(<= main_~i~2 22), 81361#(<= main_~i~2 25), 81360#(<= main_~i~2 24), 81363#(<= main_~i~2 27), 81362#(<= main_~i~2 26), 81365#(<= main_~i~2 29), 81364#(<= main_~i~2 28), 81367#(<= main_~i~2 31), 81366#(<= main_~i~2 30), 81369#(<= main_~i~2 33), 81368#(<= main_~i~2 32), 81371#(<= main_~i~2 35), 81370#(<= main_~i~2 34), 81373#(<= main_~i~2 37), 81372#(<= main_~i~2 36), 81375#(<= main_~i~2 39), 81374#(<= main_~i~2 38), 81377#(<= main_~i~2 41), 81376#(<= main_~i~2 40), 81379#(<= main_~i~2 43), 81378#(<= main_~i~2 42), 81381#(<= main_~i~2 45), 81380#(<= main_~i~2 44), 81383#(<= main_~i~2 47), 81382#(<= main_~i~2 46), 81385#(<= main_~i~2 49), 81384#(<= main_~i~2 48), 81387#(<= main_~i~2 51), 81386#(<= main_~i~2 50), 81389#(<= main_~i~2 53), 81388#(<= main_~i~2 52), 81391#(<= main_~i~2 55), 81390#(<= main_~i~2 54), 81393#(<= main_~i~2 57), 81392#(<= main_~i~2 56), 81395#(<= main_~i~2 59), 81394#(<= main_~i~2 58), 81397#(<= main_~i~2 61), 81396#(<= main_~i~2 60), 81399#(<= main_~i~2 63), 81398#(<= main_~i~2 62), 81401#(<= main_~i~2 65), 81400#(<= main_~i~2 64), 81403#(<= main_~i~2 67), 81402#(<= main_~i~2 66), 81405#(<= main_~i~2 69), 81404#(<= main_~i~2 68), 81407#(<= main_~i~2 71), 81406#(<= main_~i~2 70)] [2018-04-13 00:02:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 305669 backedges. 0 proven. 25757 refuted. 0 times theorem prover too weak. 279912 trivial. 0 not checked. [2018-04-13 00:02:40,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 00:02:40,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 00:02:40,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 00:02:40,479 INFO L87 Difference]: Start difference. First operand 717 states and 805 transitions. Second operand 89 states. [2018-04-13 00:02:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:41,182 INFO L93 Difference]: Finished difference Result 729 states and 819 transitions. [2018-04-13 00:02:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 00:02:41,183 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 4023 [2018-04-13 00:02:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:41,185 INFO L225 Difference]: With dead ends: 729 [2018-04-13 00:02:41,185 INFO L226 Difference]: Without dead ends: 729 [2018-04-13 00:02:41,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 00:02:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-04-13 00:02:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 724. [2018-04-13 00:02:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-04-13 00:02:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 813 transitions. [2018-04-13 00:02:41,194 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 813 transitions. Word has length 4023 [2018-04-13 00:02:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:41,196 INFO L459 AbstractCegarLoop]: Abstraction has 724 states and 813 transitions. [2018-04-13 00:02:41,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 00:02:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 813 transitions. [2018-04-13 00:02:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4071 [2018-04-13 00:02:41,271 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:41,271 INFO L355 BasicCegarLoop]: trace histogram [258, 258, 171, 171, 171, 171, 171, 171, 171, 171, 171, 88, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:41,271 INFO L408 AbstractCegarLoop]: === Iteration 108 === [__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-13 00:02:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1612317875, now seen corresponding path program 85 times [2018-04-13 00:02:41,272 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:41,633 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 312920 backedges. 0 proven. 26361 refuted. 0 times theorem prover too weak. 286559 trivial. 0 not checked. [2018-04-13 00:02:47,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:47,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-13 00:02:47,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 142800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 142800 trivial. 0 not checked. [2018-04-13 00:02:47,944 INFO L182 omatonBuilderFactory]: Interpolants [82945#(<= main_~i~2 67), 82944#(<= main_~i~2 66), 82947#(<= main_~i~2 69), 82946#(<= main_~i~2 68), 82949#(<= main_~i~2 71), 82948#(<= main_~i~2 70), 82951#(<= main_~i~2 73), 82950#(<= main_~i~2 72), 82953#(<= main_~i~2 75), 82952#(<= main_~i~2 74), 82955#(<= main_~i~2 77), 82954#(<= main_~i~2 76), 82957#(<= main_~i~2 79), 82956#(<= main_~i~2 78), 82959#(<= main_~i~2 81), 82958#(<= main_~i~2 80), 82961#(<= main_~i~2 83), 82960#(<= main_~i~2 82), 82963#(<= main_~i~2 85), 82962#(<= main_~i~2 84), 82965#(<= main_~i~2 87), 82964#(<= main_~i~2 86), 82877#false, 82876#true, 82879#(<= main_~i~2 1), 82878#(= main_~i~2 0), 82881#(<= main_~i~2 3), 82880#(<= main_~i~2 2), 82883#(<= main_~i~2 5), 82882#(<= main_~i~2 4), 82885#(<= main_~i~2 7), 82884#(<= main_~i~2 6), 82887#(<= main_~i~2 9), 82886#(<= main_~i~2 8), 82889#(<= main_~i~2 11), 82888#(<= main_~i~2 10), 82891#(<= main_~i~2 13), 82890#(<= main_~i~2 12), 82893#(<= main_~i~2 15), 82892#(<= main_~i~2 14), 82895#(<= main_~i~2 17), 82894#(<= main_~i~2 16), 82897#(<= main_~i~2 19), 82896#(<= main_~i~2 18), 82899#(<= main_~i~2 21), 82898#(<= main_~i~2 20), 82901#(<= main_~i~2 23), 82900#(<= main_~i~2 22), 82903#(<= main_~i~2 25), 82902#(<= main_~i~2 24), 82905#(<= main_~i~2 27), 82904#(<= main_~i~2 26), 82907#(<= main_~i~2 29), 82906#(<= main_~i~2 28), 82909#(<= main_~i~2 31), 82908#(<= main_~i~2 30), 82911#(<= main_~i~2 33), 82910#(<= main_~i~2 32), 82913#(<= main_~i~2 35), 82912#(<= main_~i~2 34), 82915#(<= main_~i~2 37), 82914#(<= main_~i~2 36), 82917#(<= main_~i~2 39), 82916#(<= main_~i~2 38), 82919#(<= main_~i~2 41), 82918#(<= main_~i~2 40), 82921#(<= main_~i~2 43), 82920#(<= main_~i~2 42), 82923#(<= main_~i~2 45), 82922#(<= main_~i~2 44), 82925#(<= main_~i~2 47), 82924#(<= main_~i~2 46), 82927#(<= main_~i~2 49), 82926#(<= main_~i~2 48), 82929#(<= main_~i~2 51), 82928#(<= main_~i~2 50), 82931#(<= main_~i~2 53), 82930#(<= main_~i~2 52), 82933#(<= main_~i~2 55), 82932#(<= main_~i~2 54), 82935#(<= main_~i~2 57), 82934#(<= main_~i~2 56), 82937#(<= main_~i~2 59), 82936#(<= main_~i~2 58), 82939#(<= main_~i~2 61), 82938#(<= main_~i~2 60), 82941#(<= main_~i~2 63), 82940#(<= main_~i~2 62), 82943#(<= main_~i~2 65), 82942#(<= main_~i~2 64)] [2018-04-13 00:02:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 312920 backedges. 0 proven. 26361 refuted. 0 times theorem prover too weak. 286559 trivial. 0 not checked. [2018-04-13 00:02:47,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 00:02:47,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 00:02:47,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 00:02:47,949 INFO L87 Difference]: Start difference. First operand 724 states and 813 transitions. Second operand 90 states. [2018-04-13 00:02:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:48,579 INFO L93 Difference]: Finished difference Result 736 states and 827 transitions. [2018-04-13 00:02:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 00:02:48,580 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 4070 [2018-04-13 00:02:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:48,582 INFO L225 Difference]: With dead ends: 736 [2018-04-13 00:02:48,582 INFO L226 Difference]: Without dead ends: 736 [2018-04-13 00:02:48,583 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 00:02:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-04-13 00:02:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 731. [2018-04-13 00:02:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-04-13 00:02:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 821 transitions. [2018-04-13 00:02:48,588 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 821 transitions. Word has length 4070 [2018-04-13 00:02:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:48,589 INFO L459 AbstractCegarLoop]: Abstraction has 731 states and 821 transitions. [2018-04-13 00:02:48,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 00:02:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 821 transitions. [2018-04-13 00:02:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4118 [2018-04-13 00:02:48,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:48,646 INFO L355 BasicCegarLoop]: trace histogram [261, 261, 173, 173, 173, 173, 173, 173, 173, 173, 173, 89, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:48,646 INFO L408 AbstractCegarLoop]: === Iteration 109 === [__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-13 00:02:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1261114765, now seen corresponding path program 86 times [2018-04-13 00:02:48,647 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:49,028 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:02:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 320256 backedges. 0 proven. 26972 refuted. 0 times theorem prover too weak. 293284 trivial. 0 not checked. [2018-04-13 00:02:55,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:02:55,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-13 00:02:55,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:02:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 146200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146200 trivial. 0 not checked. [2018-04-13 00:02:55,626 INFO L182 omatonBuilderFactory]: Interpolants [84481#(<= main_~i~2 46), 84480#(<= main_~i~2 45), 84483#(<= main_~i~2 48), 84482#(<= main_~i~2 47), 84485#(<= main_~i~2 50), 84484#(<= main_~i~2 49), 84487#(<= main_~i~2 52), 84486#(<= main_~i~2 51), 84489#(<= main_~i~2 54), 84488#(<= main_~i~2 53), 84491#(<= main_~i~2 56), 84490#(<= main_~i~2 55), 84493#(<= main_~i~2 58), 84492#(<= main_~i~2 57), 84495#(<= main_~i~2 60), 84494#(<= main_~i~2 59), 84497#(<= main_~i~2 62), 84496#(<= main_~i~2 61), 84499#(<= main_~i~2 64), 84498#(<= main_~i~2 63), 84501#(<= main_~i~2 66), 84500#(<= main_~i~2 65), 84503#(<= main_~i~2 68), 84502#(<= main_~i~2 67), 84505#(<= main_~i~2 70), 84504#(<= main_~i~2 69), 84507#(<= main_~i~2 72), 84506#(<= main_~i~2 71), 84509#(<= main_~i~2 74), 84508#(<= main_~i~2 73), 84511#(<= main_~i~2 76), 84510#(<= main_~i~2 75), 84513#(<= main_~i~2 78), 84512#(<= main_~i~2 77), 84515#(<= main_~i~2 80), 84514#(<= main_~i~2 79), 84517#(<= main_~i~2 82), 84516#(<= main_~i~2 81), 84519#(<= main_~i~2 84), 84518#(<= main_~i~2 83), 84521#(<= main_~i~2 86), 84520#(<= main_~i~2 85), 84523#(<= main_~i~2 88), 84522#(<= main_~i~2 87), 84433#true, 84435#(= main_~i~2 0), 84434#false, 84437#(<= main_~i~2 2), 84436#(<= main_~i~2 1), 84439#(<= main_~i~2 4), 84438#(<= main_~i~2 3), 84441#(<= main_~i~2 6), 84440#(<= main_~i~2 5), 84443#(<= main_~i~2 8), 84442#(<= main_~i~2 7), 84445#(<= main_~i~2 10), 84444#(<= main_~i~2 9), 84447#(<= main_~i~2 12), 84446#(<= main_~i~2 11), 84449#(<= main_~i~2 14), 84448#(<= main_~i~2 13), 84451#(<= main_~i~2 16), 84450#(<= main_~i~2 15), 84453#(<= main_~i~2 18), 84452#(<= main_~i~2 17), 84455#(<= main_~i~2 20), 84454#(<= main_~i~2 19), 84457#(<= main_~i~2 22), 84456#(<= main_~i~2 21), 84459#(<= main_~i~2 24), 84458#(<= main_~i~2 23), 84461#(<= main_~i~2 26), 84460#(<= main_~i~2 25), 84463#(<= main_~i~2 28), 84462#(<= main_~i~2 27), 84465#(<= main_~i~2 30), 84464#(<= main_~i~2 29), 84467#(<= main_~i~2 32), 84466#(<= main_~i~2 31), 84469#(<= main_~i~2 34), 84468#(<= main_~i~2 33), 84471#(<= main_~i~2 36), 84470#(<= main_~i~2 35), 84473#(<= main_~i~2 38), 84472#(<= main_~i~2 37), 84475#(<= main_~i~2 40), 84474#(<= main_~i~2 39), 84477#(<= main_~i~2 42), 84476#(<= main_~i~2 41), 84479#(<= main_~i~2 44), 84478#(<= main_~i~2 43)] [2018-04-13 00:02:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 320256 backedges. 0 proven. 26972 refuted. 0 times theorem prover too weak. 293284 trivial. 0 not checked. [2018-04-13 00:02:55,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 00:02:55,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 00:02:55,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 00:02:55,630 INFO L87 Difference]: Start difference. First operand 731 states and 821 transitions. Second operand 91 states. [2018-04-13 00:02:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:02:56,172 INFO L93 Difference]: Finished difference Result 743 states and 835 transitions. [2018-04-13 00:02:56,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 00:02:56,172 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 4117 [2018-04-13 00:02:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:02:56,175 INFO L225 Difference]: With dead ends: 743 [2018-04-13 00:02:56,175 INFO L226 Difference]: Without dead ends: 743 [2018-04-13 00:02:56,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 00:02:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-04-13 00:02:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 738. [2018-04-13 00:02:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-04-13 00:02:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 829 transitions. [2018-04-13 00:02:56,180 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 829 transitions. Word has length 4117 [2018-04-13 00:02:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:02:56,181 INFO L459 AbstractCegarLoop]: Abstraction has 738 states and 829 transitions. [2018-04-13 00:02:56,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 00:02:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 829 transitions. [2018-04-13 00:02:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4165 [2018-04-13 00:02:56,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:02:56,241 INFO L355 BasicCegarLoop]: trace histogram [264, 264, 175, 175, 175, 175, 175, 175, 175, 175, 175, 90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:02:56,241 INFO L408 AbstractCegarLoop]: === Iteration 110 === [__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-13 00:02:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1599742605, now seen corresponding path program 87 times [2018-04-13 00:02:56,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:02:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:02:56,760 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 327677 backedges. 0 proven. 27590 refuted. 0 times theorem prover too weak. 300087 trivial. 0 not checked. [2018-04-13 00:03:03,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:03,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-13 00:03:03,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 149640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149640 trivial. 0 not checked. [2018-04-13 00:03:03,538 INFO L182 omatonBuilderFactory]: Interpolants [86017#(<= main_~i~2 10), 86016#(<= main_~i~2 9), 86019#(<= main_~i~2 12), 86018#(<= main_~i~2 11), 86021#(<= main_~i~2 14), 86020#(<= main_~i~2 13), 86023#(<= main_~i~2 16), 86022#(<= main_~i~2 15), 86025#(<= main_~i~2 18), 86024#(<= main_~i~2 17), 86027#(<= main_~i~2 20), 86026#(<= main_~i~2 19), 86029#(<= main_~i~2 22), 86028#(<= main_~i~2 21), 86031#(<= main_~i~2 24), 86030#(<= main_~i~2 23), 86033#(<= main_~i~2 26), 86032#(<= main_~i~2 25), 86035#(<= main_~i~2 28), 86034#(<= main_~i~2 27), 86037#(<= main_~i~2 30), 86036#(<= main_~i~2 29), 86039#(<= main_~i~2 32), 86038#(<= main_~i~2 31), 86041#(<= main_~i~2 34), 86040#(<= main_~i~2 33), 86043#(<= main_~i~2 36), 86042#(<= main_~i~2 35), 86045#(<= main_~i~2 38), 86044#(<= main_~i~2 37), 86047#(<= main_~i~2 40), 86046#(<= main_~i~2 39), 86049#(<= main_~i~2 42), 86048#(<= main_~i~2 41), 86051#(<= main_~i~2 44), 86050#(<= main_~i~2 43), 86053#(<= main_~i~2 46), 86052#(<= main_~i~2 45), 86055#(<= main_~i~2 48), 86054#(<= main_~i~2 47), 86057#(<= main_~i~2 50), 86056#(<= main_~i~2 49), 86059#(<= main_~i~2 52), 86058#(<= main_~i~2 51), 86061#(<= main_~i~2 54), 86060#(<= main_~i~2 53), 86063#(<= main_~i~2 56), 86062#(<= main_~i~2 55), 86065#(<= main_~i~2 58), 86064#(<= main_~i~2 57), 86067#(<= main_~i~2 60), 86066#(<= main_~i~2 59), 86069#(<= main_~i~2 62), 86068#(<= main_~i~2 61), 86071#(<= main_~i~2 64), 86070#(<= main_~i~2 63), 86073#(<= main_~i~2 66), 86072#(<= main_~i~2 65), 86075#(<= main_~i~2 68), 86074#(<= main_~i~2 67), 86077#(<= main_~i~2 70), 86076#(<= main_~i~2 69), 86079#(<= main_~i~2 72), 86078#(<= main_~i~2 71), 86081#(<= main_~i~2 74), 86080#(<= main_~i~2 73), 86083#(<= main_~i~2 76), 86082#(<= main_~i~2 75), 86085#(<= main_~i~2 78), 86084#(<= main_~i~2 77), 86087#(<= main_~i~2 80), 86086#(<= main_~i~2 79), 86089#(<= main_~i~2 82), 86088#(<= main_~i~2 81), 86091#(<= main_~i~2 84), 86090#(<= main_~i~2 83), 86093#(<= main_~i~2 86), 86092#(<= main_~i~2 85), 86095#(<= main_~i~2 88), 86094#(<= main_~i~2 87), 86096#(<= main_~i~2 89), 86005#true, 86007#(= main_~i~2 0), 86006#false, 86009#(<= main_~i~2 2), 86008#(<= main_~i~2 1), 86011#(<= main_~i~2 4), 86010#(<= main_~i~2 3), 86013#(<= main_~i~2 6), 86012#(<= main_~i~2 5), 86015#(<= main_~i~2 8), 86014#(<= main_~i~2 7)] [2018-04-13 00:03:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 327677 backedges. 0 proven. 27590 refuted. 0 times theorem prover too weak. 300087 trivial. 0 not checked. [2018-04-13 00:03:03,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 00:03:03,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 00:03:03,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 00:03:03,542 INFO L87 Difference]: Start difference. First operand 738 states and 829 transitions. Second operand 92 states. [2018-04-13 00:03:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:04,429 INFO L93 Difference]: Finished difference Result 750 states and 843 transitions. [2018-04-13 00:03:04,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 00:03:04,430 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 4164 [2018-04-13 00:03:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:04,433 INFO L225 Difference]: With dead ends: 750 [2018-04-13 00:03:04,433 INFO L226 Difference]: Without dead ends: 750 [2018-04-13 00:03:04,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 00:03:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-04-13 00:03:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 745. [2018-04-13 00:03:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-13 00:03:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 837 transitions. [2018-04-13 00:03:04,441 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 837 transitions. Word has length 4164 [2018-04-13 00:03:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:04,443 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 837 transitions. [2018-04-13 00:03:04,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 00:03:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 837 transitions. [2018-04-13 00:03:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4212 [2018-04-13 00:03:04,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:04,503 INFO L355 BasicCegarLoop]: trace histogram [267, 267, 177, 177, 177, 177, 177, 177, 177, 177, 177, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:04,503 INFO L408 AbstractCegarLoop]: === Iteration 111 === [__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-13 00:03:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1070441677, now seen corresponding path program 88 times [2018-04-13 00:03:04,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:04,910 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 335183 backedges. 0 proven. 28215 refuted. 0 times theorem prover too weak. 306968 trivial. 0 not checked. [2018-04-13 00:03:11,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:11,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 00:03:11,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 153120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153120 trivial. 0 not checked. [2018-04-13 00:03:11,857 INFO L182 omatonBuilderFactory]: Interpolants [87681#(<= main_~i~2 87), 87680#(<= main_~i~2 86), 87683#(<= main_~i~2 89), 87682#(<= main_~i~2 88), 87684#(<= main_~i~2 90), 87593#false, 87592#true, 87595#(<= main_~i~2 1), 87594#(= main_~i~2 0), 87597#(<= main_~i~2 3), 87596#(<= main_~i~2 2), 87599#(<= main_~i~2 5), 87598#(<= main_~i~2 4), 87601#(<= main_~i~2 7), 87600#(<= main_~i~2 6), 87603#(<= main_~i~2 9), 87602#(<= main_~i~2 8), 87605#(<= main_~i~2 11), 87604#(<= main_~i~2 10), 87607#(<= main_~i~2 13), 87606#(<= main_~i~2 12), 87609#(<= main_~i~2 15), 87608#(<= main_~i~2 14), 87611#(<= main_~i~2 17), 87610#(<= main_~i~2 16), 87613#(<= main_~i~2 19), 87612#(<= main_~i~2 18), 87615#(<= main_~i~2 21), 87614#(<= main_~i~2 20), 87617#(<= main_~i~2 23), 87616#(<= main_~i~2 22), 87619#(<= main_~i~2 25), 87618#(<= main_~i~2 24), 87621#(<= main_~i~2 27), 87620#(<= main_~i~2 26), 87623#(<= main_~i~2 29), 87622#(<= main_~i~2 28), 87625#(<= main_~i~2 31), 87624#(<= main_~i~2 30), 87627#(<= main_~i~2 33), 87626#(<= main_~i~2 32), 87629#(<= main_~i~2 35), 87628#(<= main_~i~2 34), 87631#(<= main_~i~2 37), 87630#(<= main_~i~2 36), 87633#(<= main_~i~2 39), 87632#(<= main_~i~2 38), 87635#(<= main_~i~2 41), 87634#(<= main_~i~2 40), 87637#(<= main_~i~2 43), 87636#(<= main_~i~2 42), 87639#(<= main_~i~2 45), 87638#(<= main_~i~2 44), 87641#(<= main_~i~2 47), 87640#(<= main_~i~2 46), 87643#(<= main_~i~2 49), 87642#(<= main_~i~2 48), 87645#(<= main_~i~2 51), 87644#(<= main_~i~2 50), 87647#(<= main_~i~2 53), 87646#(<= main_~i~2 52), 87649#(<= main_~i~2 55), 87648#(<= main_~i~2 54), 87651#(<= main_~i~2 57), 87650#(<= main_~i~2 56), 87653#(<= main_~i~2 59), 87652#(<= main_~i~2 58), 87655#(<= main_~i~2 61), 87654#(<= main_~i~2 60), 87657#(<= main_~i~2 63), 87656#(<= main_~i~2 62), 87659#(<= main_~i~2 65), 87658#(<= main_~i~2 64), 87661#(<= main_~i~2 67), 87660#(<= main_~i~2 66), 87663#(<= main_~i~2 69), 87662#(<= main_~i~2 68), 87665#(<= main_~i~2 71), 87664#(<= main_~i~2 70), 87667#(<= main_~i~2 73), 87666#(<= main_~i~2 72), 87669#(<= main_~i~2 75), 87668#(<= main_~i~2 74), 87671#(<= main_~i~2 77), 87670#(<= main_~i~2 76), 87673#(<= main_~i~2 79), 87672#(<= main_~i~2 78), 87675#(<= main_~i~2 81), 87674#(<= main_~i~2 80), 87677#(<= main_~i~2 83), 87676#(<= main_~i~2 82), 87679#(<= main_~i~2 85), 87678#(<= main_~i~2 84)] [2018-04-13 00:03:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 335183 backedges. 0 proven. 28215 refuted. 0 times theorem prover too weak. 306968 trivial. 0 not checked. [2018-04-13 00:03:11,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 00:03:11,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 00:03:11,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 00:03:11,865 INFO L87 Difference]: Start difference. First operand 745 states and 837 transitions. Second operand 93 states. [2018-04-13 00:03:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:12,760 INFO L93 Difference]: Finished difference Result 757 states and 851 transitions. [2018-04-13 00:03:12,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 00:03:12,760 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 4211 [2018-04-13 00:03:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:12,763 INFO L225 Difference]: With dead ends: 757 [2018-04-13 00:03:12,763 INFO L226 Difference]: Without dead ends: 757 [2018-04-13 00:03:12,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 00:03:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-13 00:03:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 752. [2018-04-13 00:03:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-04-13 00:03:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 845 transitions. [2018-04-13 00:03:12,769 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 845 transitions. Word has length 4211 [2018-04-13 00:03:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:12,770 INFO L459 AbstractCegarLoop]: Abstraction has 752 states and 845 transitions. [2018-04-13 00:03:12,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 00:03:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 845 transitions. [2018-04-13 00:03:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4259 [2018-04-13 00:03:12,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:12,842 INFO L355 BasicCegarLoop]: trace histogram [270, 270, 179, 179, 179, 179, 179, 179, 179, 179, 179, 92, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:12,842 INFO L408 AbstractCegarLoop]: === Iteration 112 === [__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-13 00:03:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1054336563, now seen corresponding path program 89 times [2018-04-13 00:03:12,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:13,237 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 342774 backedges. 0 proven. 28847 refuted. 0 times theorem prover too weak. 313927 trivial. 0 not checked. [2018-04-13 00:03:20,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:20,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-13 00:03:20,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 156640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156640 trivial. 0 not checked. [2018-04-13 00:03:20,198 INFO L182 omatonBuilderFactory]: Interpolants [89217#(<= main_~i~2 21), 89216#(<= main_~i~2 20), 89219#(<= main_~i~2 23), 89218#(<= main_~i~2 22), 89221#(<= main_~i~2 25), 89220#(<= main_~i~2 24), 89223#(<= main_~i~2 27), 89222#(<= main_~i~2 26), 89225#(<= main_~i~2 29), 89224#(<= main_~i~2 28), 89227#(<= main_~i~2 31), 89226#(<= main_~i~2 30), 89229#(<= main_~i~2 33), 89228#(<= main_~i~2 32), 89231#(<= main_~i~2 35), 89230#(<= main_~i~2 34), 89233#(<= main_~i~2 37), 89232#(<= main_~i~2 36), 89235#(<= main_~i~2 39), 89234#(<= main_~i~2 38), 89237#(<= main_~i~2 41), 89236#(<= main_~i~2 40), 89239#(<= main_~i~2 43), 89238#(<= main_~i~2 42), 89241#(<= main_~i~2 45), 89240#(<= main_~i~2 44), 89243#(<= main_~i~2 47), 89242#(<= main_~i~2 46), 89245#(<= main_~i~2 49), 89244#(<= main_~i~2 48), 89247#(<= main_~i~2 51), 89246#(<= main_~i~2 50), 89249#(<= main_~i~2 53), 89248#(<= main_~i~2 52), 89251#(<= main_~i~2 55), 89250#(<= main_~i~2 54), 89253#(<= main_~i~2 57), 89252#(<= main_~i~2 56), 89255#(<= main_~i~2 59), 89254#(<= main_~i~2 58), 89257#(<= main_~i~2 61), 89256#(<= main_~i~2 60), 89259#(<= main_~i~2 63), 89258#(<= main_~i~2 62), 89261#(<= main_~i~2 65), 89260#(<= main_~i~2 64), 89263#(<= main_~i~2 67), 89262#(<= main_~i~2 66), 89265#(<= main_~i~2 69), 89264#(<= main_~i~2 68), 89267#(<= main_~i~2 71), 89266#(<= main_~i~2 70), 89269#(<= main_~i~2 73), 89268#(<= main_~i~2 72), 89271#(<= main_~i~2 75), 89270#(<= main_~i~2 74), 89273#(<= main_~i~2 77), 89272#(<= main_~i~2 76), 89275#(<= main_~i~2 79), 89274#(<= main_~i~2 78), 89277#(<= main_~i~2 81), 89276#(<= main_~i~2 80), 89279#(<= main_~i~2 83), 89278#(<= main_~i~2 82), 89281#(<= main_~i~2 85), 89280#(<= main_~i~2 84), 89283#(<= main_~i~2 87), 89282#(<= main_~i~2 86), 89285#(<= main_~i~2 89), 89284#(<= main_~i~2 88), 89287#(<= main_~i~2 91), 89286#(<= main_~i~2 90), 89195#false, 89194#true, 89197#(<= main_~i~2 1), 89196#(= main_~i~2 0), 89199#(<= main_~i~2 3), 89198#(<= main_~i~2 2), 89201#(<= main_~i~2 5), 89200#(<= main_~i~2 4), 89203#(<= main_~i~2 7), 89202#(<= main_~i~2 6), 89205#(<= main_~i~2 9), 89204#(<= main_~i~2 8), 89207#(<= main_~i~2 11), 89206#(<= main_~i~2 10), 89209#(<= main_~i~2 13), 89208#(<= main_~i~2 12), 89211#(<= main_~i~2 15), 89210#(<= main_~i~2 14), 89213#(<= main_~i~2 17), 89212#(<= main_~i~2 16), 89215#(<= main_~i~2 19), 89214#(<= main_~i~2 18)] [2018-04-13 00:03:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 342774 backedges. 0 proven. 28847 refuted. 0 times theorem prover too weak. 313927 trivial. 0 not checked. [2018-04-13 00:03:20,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-13 00:03:20,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-13 00:03:20,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 00:03:20,202 INFO L87 Difference]: Start difference. First operand 752 states and 845 transitions. Second operand 94 states. [2018-04-13 00:03:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:21,020 INFO L93 Difference]: Finished difference Result 764 states and 859 transitions. [2018-04-13 00:03:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 00:03:21,020 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 4258 [2018-04-13 00:03:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:21,023 INFO L225 Difference]: With dead ends: 764 [2018-04-13 00:03:21,023 INFO L226 Difference]: Without dead ends: 764 [2018-04-13 00:03:21,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 00:03:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-04-13 00:03:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 759. [2018-04-13 00:03:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-04-13 00:03:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 853 transitions. [2018-04-13 00:03:21,028 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 853 transitions. Word has length 4258 [2018-04-13 00:03:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:21,028 INFO L459 AbstractCegarLoop]: Abstraction has 759 states and 853 transitions. [2018-04-13 00:03:21,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-13 00:03:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 853 transitions. [2018-04-13 00:03:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4306 [2018-04-13 00:03:21,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:21,091 INFO L355 BasicCegarLoop]: trace histogram [273, 273, 181, 181, 181, 181, 181, 181, 181, 181, 181, 93, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 92, 91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:21,092 INFO L408 AbstractCegarLoop]: === Iteration 113 === [__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-13 00:03:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash -744752141, now seen corresponding path program 90 times [2018-04-13 00:03:21,092 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:21,485 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 350450 backedges. 0 proven. 29486 refuted. 0 times theorem prover too weak. 320964 trivial. 0 not checked. [2018-04-13 00:03:28,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:28,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-13 00:03:28,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 160200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160200 trivial. 0 not checked. [2018-04-13 00:03:28,688 INFO L182 omatonBuilderFactory]: Interpolants [90881#(<= main_~i~2 68), 90880#(<= main_~i~2 67), 90883#(<= main_~i~2 70), 90882#(<= main_~i~2 69), 90885#(<= main_~i~2 72), 90884#(<= main_~i~2 71), 90887#(<= main_~i~2 74), 90886#(<= main_~i~2 73), 90889#(<= main_~i~2 76), 90888#(<= main_~i~2 75), 90891#(<= main_~i~2 78), 90890#(<= main_~i~2 77), 90893#(<= main_~i~2 80), 90892#(<= main_~i~2 79), 90895#(<= main_~i~2 82), 90894#(<= main_~i~2 81), 90897#(<= main_~i~2 84), 90896#(<= main_~i~2 83), 90899#(<= main_~i~2 86), 90898#(<= main_~i~2 85), 90901#(<= main_~i~2 88), 90900#(<= main_~i~2 87), 90903#(<= main_~i~2 90), 90902#(<= main_~i~2 89), 90905#(<= main_~i~2 92), 90904#(<= main_~i~2 91), 90811#true, 90813#(= main_~i~2 0), 90812#false, 90815#(<= main_~i~2 2), 90814#(<= main_~i~2 1), 90817#(<= main_~i~2 4), 90816#(<= main_~i~2 3), 90819#(<= main_~i~2 6), 90818#(<= main_~i~2 5), 90821#(<= main_~i~2 8), 90820#(<= main_~i~2 7), 90823#(<= main_~i~2 10), 90822#(<= main_~i~2 9), 90825#(<= main_~i~2 12), 90824#(<= main_~i~2 11), 90827#(<= main_~i~2 14), 90826#(<= main_~i~2 13), 90829#(<= main_~i~2 16), 90828#(<= main_~i~2 15), 90831#(<= main_~i~2 18), 90830#(<= main_~i~2 17), 90833#(<= main_~i~2 20), 90832#(<= main_~i~2 19), 90835#(<= main_~i~2 22), 90834#(<= main_~i~2 21), 90837#(<= main_~i~2 24), 90836#(<= main_~i~2 23), 90839#(<= main_~i~2 26), 90838#(<= main_~i~2 25), 90841#(<= main_~i~2 28), 90840#(<= main_~i~2 27), 90843#(<= main_~i~2 30), 90842#(<= main_~i~2 29), 90845#(<= main_~i~2 32), 90844#(<= main_~i~2 31), 90847#(<= main_~i~2 34), 90846#(<= main_~i~2 33), 90849#(<= main_~i~2 36), 90848#(<= main_~i~2 35), 90851#(<= main_~i~2 38), 90850#(<= main_~i~2 37), 90853#(<= main_~i~2 40), 90852#(<= main_~i~2 39), 90855#(<= main_~i~2 42), 90854#(<= main_~i~2 41), 90857#(<= main_~i~2 44), 90856#(<= main_~i~2 43), 90859#(<= main_~i~2 46), 90858#(<= main_~i~2 45), 90861#(<= main_~i~2 48), 90860#(<= main_~i~2 47), 90863#(<= main_~i~2 50), 90862#(<= main_~i~2 49), 90865#(<= main_~i~2 52), 90864#(<= main_~i~2 51), 90867#(<= main_~i~2 54), 90866#(<= main_~i~2 53), 90869#(<= main_~i~2 56), 90868#(<= main_~i~2 55), 90871#(<= main_~i~2 58), 90870#(<= main_~i~2 57), 90873#(<= main_~i~2 60), 90872#(<= main_~i~2 59), 90875#(<= main_~i~2 62), 90874#(<= main_~i~2 61), 90877#(<= main_~i~2 64), 90876#(<= main_~i~2 63), 90879#(<= main_~i~2 66), 90878#(<= main_~i~2 65)] [2018-04-13 00:03:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 350450 backedges. 0 proven. 29486 refuted. 0 times theorem prover too weak. 320964 trivial. 0 not checked. [2018-04-13 00:03:28,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 00:03:28,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 00:03:28,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 00:03:28,693 INFO L87 Difference]: Start difference. First operand 759 states and 853 transitions. Second operand 95 states. [2018-04-13 00:03:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:29,392 INFO L93 Difference]: Finished difference Result 771 states and 867 transitions. [2018-04-13 00:03:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 00:03:29,392 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 4305 [2018-04-13 00:03:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:29,395 INFO L225 Difference]: With dead ends: 771 [2018-04-13 00:03:29,395 INFO L226 Difference]: Without dead ends: 771 [2018-04-13 00:03:29,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 00:03:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-04-13 00:03:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 766. [2018-04-13 00:03:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-04-13 00:03:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 861 transitions. [2018-04-13 00:03:29,400 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 861 transitions. Word has length 4305 [2018-04-13 00:03:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:29,401 INFO L459 AbstractCegarLoop]: Abstraction has 766 states and 861 transitions. [2018-04-13 00:03:29,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 00:03:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 861 transitions. [2018-04-13 00:03:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4353 [2018-04-13 00:03:29,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:29,466 INFO L355 BasicCegarLoop]: trace histogram [276, 276, 183, 183, 183, 183, 183, 183, 183, 183, 183, 94, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:29,466 INFO L408 AbstractCegarLoop]: === Iteration 114 === [__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-13 00:03:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1346117363, now seen corresponding path program 91 times [2018-04-13 00:03:29,466 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:29,918 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 358211 backedges. 0 proven. 30132 refuted. 0 times theorem prover too weak. 328079 trivial. 0 not checked. [2018-04-13 00:03:37,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:37,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-13 00:03:37,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 163800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163800 trivial. 0 not checked. [2018-04-13 00:03:37,178 INFO L182 omatonBuilderFactory]: Interpolants [92443#true, 92445#(= main_~i~2 0), 92444#false, 92447#(<= main_~i~2 2), 92446#(<= main_~i~2 1), 92449#(<= main_~i~2 4), 92448#(<= main_~i~2 3), 92451#(<= main_~i~2 6), 92450#(<= main_~i~2 5), 92453#(<= main_~i~2 8), 92452#(<= main_~i~2 7), 92455#(<= main_~i~2 10), 92454#(<= main_~i~2 9), 92457#(<= main_~i~2 12), 92456#(<= main_~i~2 11), 92459#(<= main_~i~2 14), 92458#(<= main_~i~2 13), 92461#(<= main_~i~2 16), 92460#(<= main_~i~2 15), 92463#(<= main_~i~2 18), 92462#(<= main_~i~2 17), 92465#(<= main_~i~2 20), 92464#(<= main_~i~2 19), 92467#(<= main_~i~2 22), 92466#(<= main_~i~2 21), 92469#(<= main_~i~2 24), 92468#(<= main_~i~2 23), 92471#(<= main_~i~2 26), 92470#(<= main_~i~2 25), 92473#(<= main_~i~2 28), 92472#(<= main_~i~2 27), 92475#(<= main_~i~2 30), 92474#(<= main_~i~2 29), 92477#(<= main_~i~2 32), 92476#(<= main_~i~2 31), 92479#(<= main_~i~2 34), 92478#(<= main_~i~2 33), 92481#(<= main_~i~2 36), 92480#(<= main_~i~2 35), 92483#(<= main_~i~2 38), 92482#(<= main_~i~2 37), 92485#(<= main_~i~2 40), 92484#(<= main_~i~2 39), 92487#(<= main_~i~2 42), 92486#(<= main_~i~2 41), 92489#(<= main_~i~2 44), 92488#(<= main_~i~2 43), 92491#(<= main_~i~2 46), 92490#(<= main_~i~2 45), 92493#(<= main_~i~2 48), 92492#(<= main_~i~2 47), 92495#(<= main_~i~2 50), 92494#(<= main_~i~2 49), 92497#(<= main_~i~2 52), 92496#(<= main_~i~2 51), 92499#(<= main_~i~2 54), 92498#(<= main_~i~2 53), 92501#(<= main_~i~2 56), 92500#(<= main_~i~2 55), 92503#(<= main_~i~2 58), 92502#(<= main_~i~2 57), 92505#(<= main_~i~2 60), 92504#(<= main_~i~2 59), 92507#(<= main_~i~2 62), 92506#(<= main_~i~2 61), 92509#(<= main_~i~2 64), 92508#(<= main_~i~2 63), 92511#(<= main_~i~2 66), 92510#(<= main_~i~2 65), 92513#(<= main_~i~2 68), 92512#(<= main_~i~2 67), 92515#(<= main_~i~2 70), 92514#(<= main_~i~2 69), 92517#(<= main_~i~2 72), 92516#(<= main_~i~2 71), 92519#(<= main_~i~2 74), 92518#(<= main_~i~2 73), 92521#(<= main_~i~2 76), 92520#(<= main_~i~2 75), 92523#(<= main_~i~2 78), 92522#(<= main_~i~2 77), 92525#(<= main_~i~2 80), 92524#(<= main_~i~2 79), 92527#(<= main_~i~2 82), 92526#(<= main_~i~2 81), 92529#(<= main_~i~2 84), 92528#(<= main_~i~2 83), 92531#(<= main_~i~2 86), 92530#(<= main_~i~2 85), 92533#(<= main_~i~2 88), 92532#(<= main_~i~2 87), 92535#(<= main_~i~2 90), 92534#(<= main_~i~2 89), 92537#(<= main_~i~2 92), 92536#(<= main_~i~2 91), 92538#(<= main_~i~2 93)] [2018-04-13 00:03:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 358211 backedges. 0 proven. 30132 refuted. 0 times theorem prover too weak. 328079 trivial. 0 not checked. [2018-04-13 00:03:37,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-13 00:03:37,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-13 00:03:37,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 00:03:37,182 INFO L87 Difference]: Start difference. First operand 766 states and 861 transitions. Second operand 96 states. [2018-04-13 00:03:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:38,280 INFO L93 Difference]: Finished difference Result 778 states and 875 transitions. [2018-04-13 00:03:38,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 00:03:38,280 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 4352 [2018-04-13 00:03:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:38,282 INFO L225 Difference]: With dead ends: 778 [2018-04-13 00:03:38,282 INFO L226 Difference]: Without dead ends: 778 [2018-04-13 00:03:38,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 00:03:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-04-13 00:03:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 773. [2018-04-13 00:03:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-04-13 00:03:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 869 transitions. [2018-04-13 00:03:38,288 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 869 transitions. Word has length 4352 [2018-04-13 00:03:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:38,289 INFO L459 AbstractCegarLoop]: Abstraction has 773 states and 869 transitions. [2018-04-13 00:03:38,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-13 00:03:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 869 transitions. [2018-04-13 00:03:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4400 [2018-04-13 00:03:38,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:38,352 INFO L355 BasicCegarLoop]: trace histogram [279, 279, 185, 185, 185, 185, 185, 185, 185, 185, 185, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:38,352 INFO L408 AbstractCegarLoop]: === Iteration 115 === [__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-13 00:03:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 505269427, now seen corresponding path program 92 times [2018-04-13 00:03:38,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:38,842 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 366057 backedges. 0 proven. 30785 refuted. 0 times theorem prover too weak. 335272 trivial. 0 not checked. [2018-04-13 00:03:46,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:46,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-13 00:03:46,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 167440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167440 trivial. 0 not checked. [2018-04-13 00:03:46,562 INFO L182 omatonBuilderFactory]: Interpolants [94091#false, 94090#true, 94093#(<= main_~i~2 1), 94092#(= main_~i~2 0), 94095#(<= main_~i~2 3), 94094#(<= main_~i~2 2), 94097#(<= main_~i~2 5), 94096#(<= main_~i~2 4), 94099#(<= main_~i~2 7), 94098#(<= main_~i~2 6), 94101#(<= main_~i~2 9), 94100#(<= main_~i~2 8), 94103#(<= main_~i~2 11), 94102#(<= main_~i~2 10), 94105#(<= main_~i~2 13), 94104#(<= main_~i~2 12), 94107#(<= main_~i~2 15), 94106#(<= main_~i~2 14), 94109#(<= main_~i~2 17), 94108#(<= main_~i~2 16), 94111#(<= main_~i~2 19), 94110#(<= main_~i~2 18), 94113#(<= main_~i~2 21), 94112#(<= main_~i~2 20), 94115#(<= main_~i~2 23), 94114#(<= main_~i~2 22), 94117#(<= main_~i~2 25), 94116#(<= main_~i~2 24), 94119#(<= main_~i~2 27), 94118#(<= main_~i~2 26), 94121#(<= main_~i~2 29), 94120#(<= main_~i~2 28), 94123#(<= main_~i~2 31), 94122#(<= main_~i~2 30), 94125#(<= main_~i~2 33), 94124#(<= main_~i~2 32), 94127#(<= main_~i~2 35), 94126#(<= main_~i~2 34), 94129#(<= main_~i~2 37), 94128#(<= main_~i~2 36), 94131#(<= main_~i~2 39), 94130#(<= main_~i~2 38), 94133#(<= main_~i~2 41), 94132#(<= main_~i~2 40), 94135#(<= main_~i~2 43), 94134#(<= main_~i~2 42), 94137#(<= main_~i~2 45), 94136#(<= main_~i~2 44), 94139#(<= main_~i~2 47), 94138#(<= main_~i~2 46), 94141#(<= main_~i~2 49), 94140#(<= main_~i~2 48), 94143#(<= main_~i~2 51), 94142#(<= main_~i~2 50), 94145#(<= main_~i~2 53), 94144#(<= main_~i~2 52), 94147#(<= main_~i~2 55), 94146#(<= main_~i~2 54), 94149#(<= main_~i~2 57), 94148#(<= main_~i~2 56), 94151#(<= main_~i~2 59), 94150#(<= main_~i~2 58), 94153#(<= main_~i~2 61), 94152#(<= main_~i~2 60), 94155#(<= main_~i~2 63), 94154#(<= main_~i~2 62), 94157#(<= main_~i~2 65), 94156#(<= main_~i~2 64), 94159#(<= main_~i~2 67), 94158#(<= main_~i~2 66), 94161#(<= main_~i~2 69), 94160#(<= main_~i~2 68), 94163#(<= main_~i~2 71), 94162#(<= main_~i~2 70), 94165#(<= main_~i~2 73), 94164#(<= main_~i~2 72), 94167#(<= main_~i~2 75), 94166#(<= main_~i~2 74), 94169#(<= main_~i~2 77), 94168#(<= main_~i~2 76), 94171#(<= main_~i~2 79), 94170#(<= main_~i~2 78), 94173#(<= main_~i~2 81), 94172#(<= main_~i~2 80), 94175#(<= main_~i~2 83), 94174#(<= main_~i~2 82), 94177#(<= main_~i~2 85), 94176#(<= main_~i~2 84), 94179#(<= main_~i~2 87), 94178#(<= main_~i~2 86), 94181#(<= main_~i~2 89), 94180#(<= main_~i~2 88), 94183#(<= main_~i~2 91), 94182#(<= main_~i~2 90), 94185#(<= main_~i~2 93), 94184#(<= main_~i~2 92), 94186#(<= main_~i~2 94)] [2018-04-13 00:03:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 366057 backedges. 0 proven. 30785 refuted. 0 times theorem prover too weak. 335272 trivial. 0 not checked. [2018-04-13 00:03:46,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 00:03:46,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 00:03:46,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 00:03:46,567 INFO L87 Difference]: Start difference. First operand 773 states and 869 transitions. Second operand 97 states. [2018-04-13 00:03:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:47,698 INFO L93 Difference]: Finished difference Result 785 states and 883 transitions. [2018-04-13 00:03:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 00:03:47,698 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 4399 [2018-04-13 00:03:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:47,701 INFO L225 Difference]: With dead ends: 785 [2018-04-13 00:03:47,701 INFO L226 Difference]: Without dead ends: 785 [2018-04-13 00:03:47,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 00:03:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-04-13 00:03:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 780. [2018-04-13 00:03:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-04-13 00:03:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 877 transitions. [2018-04-13 00:03:47,707 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 877 transitions. Word has length 4399 [2018-04-13 00:03:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:47,708 INFO L459 AbstractCegarLoop]: Abstraction has 780 states and 877 transitions. [2018-04-13 00:03:47,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 00:03:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 877 transitions. [2018-04-13 00:03:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4447 [2018-04-13 00:03:47,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:47,775 INFO L355 BasicCegarLoop]: trace histogram [282, 282, 187, 187, 187, 187, 187, 187, 187, 187, 187, 96, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:47,775 INFO L408 AbstractCegarLoop]: === Iteration 116 === [__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-13 00:03:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1298040755, now seen corresponding path program 93 times [2018-04-13 00:03:47,776 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:48,206 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:03:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 373988 backedges. 0 proven. 31445 refuted. 0 times theorem prover too weak. 342543 trivial. 0 not checked. [2018-04-13 00:03:55,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:03:55,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-13 00:03:55,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:03:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 171120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171120 trivial. 0 not checked. [2018-04-13 00:03:55,735 INFO L182 omatonBuilderFactory]: Interpolants [95753#false, 95752#true, 95755#(<= main_~i~2 1), 95754#(= main_~i~2 0), 95757#(<= main_~i~2 3), 95756#(<= main_~i~2 2), 95759#(<= main_~i~2 5), 95758#(<= main_~i~2 4), 95761#(<= main_~i~2 7), 95760#(<= main_~i~2 6), 95763#(<= main_~i~2 9), 95762#(<= main_~i~2 8), 95765#(<= main_~i~2 11), 95764#(<= main_~i~2 10), 95767#(<= main_~i~2 13), 95766#(<= main_~i~2 12), 95769#(<= main_~i~2 15), 95768#(<= main_~i~2 14), 95771#(<= main_~i~2 17), 95770#(<= main_~i~2 16), 95773#(<= main_~i~2 19), 95772#(<= main_~i~2 18), 95775#(<= main_~i~2 21), 95774#(<= main_~i~2 20), 95777#(<= main_~i~2 23), 95776#(<= main_~i~2 22), 95779#(<= main_~i~2 25), 95778#(<= main_~i~2 24), 95781#(<= main_~i~2 27), 95780#(<= main_~i~2 26), 95783#(<= main_~i~2 29), 95782#(<= main_~i~2 28), 95785#(<= main_~i~2 31), 95784#(<= main_~i~2 30), 95787#(<= main_~i~2 33), 95786#(<= main_~i~2 32), 95789#(<= main_~i~2 35), 95788#(<= main_~i~2 34), 95791#(<= main_~i~2 37), 95790#(<= main_~i~2 36), 95793#(<= main_~i~2 39), 95792#(<= main_~i~2 38), 95795#(<= main_~i~2 41), 95794#(<= main_~i~2 40), 95797#(<= main_~i~2 43), 95796#(<= main_~i~2 42), 95799#(<= main_~i~2 45), 95798#(<= main_~i~2 44), 95801#(<= main_~i~2 47), 95800#(<= main_~i~2 46), 95803#(<= main_~i~2 49), 95802#(<= main_~i~2 48), 95805#(<= main_~i~2 51), 95804#(<= main_~i~2 50), 95807#(<= main_~i~2 53), 95806#(<= main_~i~2 52), 95809#(<= main_~i~2 55), 95808#(<= main_~i~2 54), 95811#(<= main_~i~2 57), 95810#(<= main_~i~2 56), 95813#(<= main_~i~2 59), 95812#(<= main_~i~2 58), 95815#(<= main_~i~2 61), 95814#(<= main_~i~2 60), 95817#(<= main_~i~2 63), 95816#(<= main_~i~2 62), 95819#(<= main_~i~2 65), 95818#(<= main_~i~2 64), 95821#(<= main_~i~2 67), 95820#(<= main_~i~2 66), 95823#(<= main_~i~2 69), 95822#(<= main_~i~2 68), 95825#(<= main_~i~2 71), 95824#(<= main_~i~2 70), 95827#(<= main_~i~2 73), 95826#(<= main_~i~2 72), 95829#(<= main_~i~2 75), 95828#(<= main_~i~2 74), 95831#(<= main_~i~2 77), 95830#(<= main_~i~2 76), 95833#(<= main_~i~2 79), 95832#(<= main_~i~2 78), 95835#(<= main_~i~2 81), 95834#(<= main_~i~2 80), 95837#(<= main_~i~2 83), 95836#(<= main_~i~2 82), 95839#(<= main_~i~2 85), 95838#(<= main_~i~2 84), 95841#(<= main_~i~2 87), 95840#(<= main_~i~2 86), 95843#(<= main_~i~2 89), 95842#(<= main_~i~2 88), 95845#(<= main_~i~2 91), 95844#(<= main_~i~2 90), 95847#(<= main_~i~2 93), 95846#(<= main_~i~2 92), 95849#(<= main_~i~2 95), 95848#(<= main_~i~2 94)] [2018-04-13 00:03:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 373988 backedges. 0 proven. 31445 refuted. 0 times theorem prover too weak. 342543 trivial. 0 not checked. [2018-04-13 00:03:55,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 00:03:55,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 00:03:55,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 00:03:55,739 INFO L87 Difference]: Start difference. First operand 780 states and 877 transitions. Second operand 98 states. [2018-04-13 00:03:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:03:56,896 INFO L93 Difference]: Finished difference Result 792 states and 891 transitions. [2018-04-13 00:03:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 00:03:56,896 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 4446 [2018-04-13 00:03:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:03:56,899 INFO L225 Difference]: With dead ends: 792 [2018-04-13 00:03:56,899 INFO L226 Difference]: Without dead ends: 792 [2018-04-13 00:03:56,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 00:03:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-04-13 00:03:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 787. [2018-04-13 00:03:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-04-13 00:03:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 885 transitions. [2018-04-13 00:03:56,905 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 885 transitions. Word has length 4446 [2018-04-13 00:03:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:03:56,907 INFO L459 AbstractCegarLoop]: Abstraction has 787 states and 885 transitions. [2018-04-13 00:03:56,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 00:03:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 885 transitions. [2018-04-13 00:03:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4494 [2018-04-13 00:03:56,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:03:56,986 INFO L355 BasicCegarLoop]: trace histogram [285, 285, 189, 189, 189, 189, 189, 189, 189, 189, 189, 97, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:03:56,986 INFO L408 AbstractCegarLoop]: === Iteration 117 === [__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-13 00:03:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1849438861, now seen corresponding path program 94 times [2018-04-13 00:03:56,987 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:03:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:03:57,476 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 382004 backedges. 0 proven. 32112 refuted. 0 times theorem prover too weak. 349892 trivial. 0 not checked. [2018-04-13 00:04:05,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:05,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 00:04:05,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 174840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174840 trivial. 0 not checked. [2018-04-13 00:04:05,813 INFO L182 omatonBuilderFactory]: Interpolants [97429#true, 97431#(= main_~i~2 0), 97430#false, 97433#(<= main_~i~2 2), 97432#(<= main_~i~2 1), 97435#(<= main_~i~2 4), 97434#(<= main_~i~2 3), 97437#(<= main_~i~2 6), 97436#(<= main_~i~2 5), 97439#(<= main_~i~2 8), 97438#(<= main_~i~2 7), 97441#(<= main_~i~2 10), 97440#(<= main_~i~2 9), 97443#(<= main_~i~2 12), 97442#(<= main_~i~2 11), 97445#(<= main_~i~2 14), 97444#(<= main_~i~2 13), 97447#(<= main_~i~2 16), 97446#(<= main_~i~2 15), 97449#(<= main_~i~2 18), 97448#(<= main_~i~2 17), 97451#(<= main_~i~2 20), 97450#(<= main_~i~2 19), 97453#(<= main_~i~2 22), 97452#(<= main_~i~2 21), 97455#(<= main_~i~2 24), 97454#(<= main_~i~2 23), 97457#(<= main_~i~2 26), 97456#(<= main_~i~2 25), 97459#(<= main_~i~2 28), 97458#(<= main_~i~2 27), 97461#(<= main_~i~2 30), 97460#(<= main_~i~2 29), 97463#(<= main_~i~2 32), 97462#(<= main_~i~2 31), 97465#(<= main_~i~2 34), 97464#(<= main_~i~2 33), 97467#(<= main_~i~2 36), 97466#(<= main_~i~2 35), 97469#(<= main_~i~2 38), 97468#(<= main_~i~2 37), 97471#(<= main_~i~2 40), 97470#(<= main_~i~2 39), 97473#(<= main_~i~2 42), 97472#(<= main_~i~2 41), 97475#(<= main_~i~2 44), 97474#(<= main_~i~2 43), 97477#(<= main_~i~2 46), 97476#(<= main_~i~2 45), 97479#(<= main_~i~2 48), 97478#(<= main_~i~2 47), 97481#(<= main_~i~2 50), 97480#(<= main_~i~2 49), 97483#(<= main_~i~2 52), 97482#(<= main_~i~2 51), 97485#(<= main_~i~2 54), 97484#(<= main_~i~2 53), 97487#(<= main_~i~2 56), 97486#(<= main_~i~2 55), 97489#(<= main_~i~2 58), 97488#(<= main_~i~2 57), 97491#(<= main_~i~2 60), 97490#(<= main_~i~2 59), 97493#(<= main_~i~2 62), 97492#(<= main_~i~2 61), 97495#(<= main_~i~2 64), 97494#(<= main_~i~2 63), 97497#(<= main_~i~2 66), 97496#(<= main_~i~2 65), 97499#(<= main_~i~2 68), 97498#(<= main_~i~2 67), 97501#(<= main_~i~2 70), 97500#(<= main_~i~2 69), 97503#(<= main_~i~2 72), 97502#(<= main_~i~2 71), 97505#(<= main_~i~2 74), 97504#(<= main_~i~2 73), 97507#(<= main_~i~2 76), 97506#(<= main_~i~2 75), 97509#(<= main_~i~2 78), 97508#(<= main_~i~2 77), 97511#(<= main_~i~2 80), 97510#(<= main_~i~2 79), 97513#(<= main_~i~2 82), 97512#(<= main_~i~2 81), 97515#(<= main_~i~2 84), 97514#(<= main_~i~2 83), 97517#(<= main_~i~2 86), 97516#(<= main_~i~2 85), 97519#(<= main_~i~2 88), 97518#(<= main_~i~2 87), 97521#(<= main_~i~2 90), 97520#(<= main_~i~2 89), 97523#(<= main_~i~2 92), 97522#(<= main_~i~2 91), 97525#(<= main_~i~2 94), 97524#(<= main_~i~2 93), 97527#(<= main_~i~2 96), 97526#(<= main_~i~2 95)] [2018-04-13 00:04:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 382004 backedges. 0 proven. 32112 refuted. 0 times theorem prover too weak. 349892 trivial. 0 not checked. [2018-04-13 00:04:05,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 00:04:05,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 00:04:05,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 00:04:05,819 INFO L87 Difference]: Start difference. First operand 787 states and 885 transitions. Second operand 99 states. [2018-04-13 00:04:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:07,099 INFO L93 Difference]: Finished difference Result 799 states and 899 transitions. [2018-04-13 00:04:07,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 00:04:07,099 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 4493 [2018-04-13 00:04:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:07,102 INFO L225 Difference]: With dead ends: 799 [2018-04-13 00:04:07,102 INFO L226 Difference]: Without dead ends: 799 [2018-04-13 00:04:07,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 00:04:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-13 00:04:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 794. [2018-04-13 00:04:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-04-13 00:04:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 893 transitions. [2018-04-13 00:04:07,108 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 893 transitions. Word has length 4493 [2018-04-13 00:04:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:07,109 INFO L459 AbstractCegarLoop]: Abstraction has 794 states and 893 transitions. [2018-04-13 00:04:07,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 00:04:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 893 transitions. [2018-04-13 00:04:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4541 [2018-04-13 00:04:07,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:07,182 INFO L355 BasicCegarLoop]: trace histogram [288, 288, 191, 191, 191, 191, 191, 191, 191, 191, 191, 98, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:07,182 INFO L408 AbstractCegarLoop]: === Iteration 118 === [__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-13 00:04:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash 775217037, now seen corresponding path program 95 times [2018-04-13 00:04:07,183 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:07,711 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 390105 backedges. 0 proven. 32786 refuted. 0 times theorem prover too weak. 357319 trivial. 0 not checked. [2018-04-13 00:04:17,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:17,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-13 00:04:17,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 178600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178600 trivial. 0 not checked. [2018-04-13 00:04:17,679 INFO L182 omatonBuilderFactory]: Interpolants [99121#true, 99123#(= main_~i~2 0), 99122#false, 99125#(<= main_~i~2 2), 99124#(<= main_~i~2 1), 99127#(<= main_~i~2 4), 99126#(<= main_~i~2 3), 99129#(<= main_~i~2 6), 99128#(<= main_~i~2 5), 99131#(<= main_~i~2 8), 99130#(<= main_~i~2 7), 99133#(<= main_~i~2 10), 99132#(<= main_~i~2 9), 99135#(<= main_~i~2 12), 99134#(<= main_~i~2 11), 99137#(<= main_~i~2 14), 99136#(<= main_~i~2 13), 99139#(<= main_~i~2 16), 99138#(<= main_~i~2 15), 99141#(<= main_~i~2 18), 99140#(<= main_~i~2 17), 99143#(<= main_~i~2 20), 99142#(<= main_~i~2 19), 99145#(<= main_~i~2 22), 99144#(<= main_~i~2 21), 99147#(<= main_~i~2 24), 99146#(<= main_~i~2 23), 99149#(<= main_~i~2 26), 99148#(<= main_~i~2 25), 99151#(<= main_~i~2 28), 99150#(<= main_~i~2 27), 99153#(<= main_~i~2 30), 99152#(<= main_~i~2 29), 99155#(<= main_~i~2 32), 99154#(<= main_~i~2 31), 99157#(<= main_~i~2 34), 99156#(<= main_~i~2 33), 99159#(<= main_~i~2 36), 99158#(<= main_~i~2 35), 99161#(<= main_~i~2 38), 99160#(<= main_~i~2 37), 99163#(<= main_~i~2 40), 99162#(<= main_~i~2 39), 99165#(<= main_~i~2 42), 99164#(<= main_~i~2 41), 99167#(<= main_~i~2 44), 99166#(<= main_~i~2 43), 99169#(<= main_~i~2 46), 99168#(<= main_~i~2 45), 99171#(<= main_~i~2 48), 99170#(<= main_~i~2 47), 99173#(<= main_~i~2 50), 99172#(<= main_~i~2 49), 99175#(<= main_~i~2 52), 99174#(<= main_~i~2 51), 99177#(<= main_~i~2 54), 99176#(<= main_~i~2 53), 99179#(<= main_~i~2 56), 99178#(<= main_~i~2 55), 99181#(<= main_~i~2 58), 99180#(<= main_~i~2 57), 99183#(<= main_~i~2 60), 99182#(<= main_~i~2 59), 99185#(<= main_~i~2 62), 99184#(<= main_~i~2 61), 99187#(<= main_~i~2 64), 99186#(<= main_~i~2 63), 99189#(<= main_~i~2 66), 99188#(<= main_~i~2 65), 99191#(<= main_~i~2 68), 99190#(<= main_~i~2 67), 99193#(<= main_~i~2 70), 99192#(<= main_~i~2 69), 99195#(<= main_~i~2 72), 99194#(<= main_~i~2 71), 99197#(<= main_~i~2 74), 99196#(<= main_~i~2 73), 99199#(<= main_~i~2 76), 99198#(<= main_~i~2 75), 99201#(<= main_~i~2 78), 99200#(<= main_~i~2 77), 99203#(<= main_~i~2 80), 99202#(<= main_~i~2 79), 99205#(<= main_~i~2 82), 99204#(<= main_~i~2 81), 99207#(<= main_~i~2 84), 99206#(<= main_~i~2 83), 99209#(<= main_~i~2 86), 99208#(<= main_~i~2 85), 99211#(<= main_~i~2 88), 99210#(<= main_~i~2 87), 99213#(<= main_~i~2 90), 99212#(<= main_~i~2 89), 99215#(<= main_~i~2 92), 99214#(<= main_~i~2 91), 99217#(<= main_~i~2 94), 99216#(<= main_~i~2 93), 99219#(<= main_~i~2 96), 99218#(<= main_~i~2 95), 99220#(<= main_~i~2 97)] [2018-04-13 00:04:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 390105 backedges. 0 proven. 32786 refuted. 0 times theorem prover too weak. 357319 trivial. 0 not checked. [2018-04-13 00:04:17,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 00:04:17,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 00:04:17,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 00:04:17,684 INFO L87 Difference]: Start difference. First operand 794 states and 893 transitions. Second operand 100 states. [2018-04-13 00:04:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:18,849 INFO L93 Difference]: Finished difference Result 806 states and 907 transitions. [2018-04-13 00:04:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 00:04:18,849 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 4540 [2018-04-13 00:04:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:18,852 INFO L225 Difference]: With dead ends: 806 [2018-04-13 00:04:18,852 INFO L226 Difference]: Without dead ends: 806 [2018-04-13 00:04:18,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 00:04:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-04-13 00:04:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 801. [2018-04-13 00:04:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-04-13 00:04:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 901 transitions. [2018-04-13 00:04:18,857 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 901 transitions. Word has length 4540 [2018-04-13 00:04:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:18,858 INFO L459 AbstractCegarLoop]: Abstraction has 801 states and 901 transitions. [2018-04-13 00:04:18,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 00:04:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 901 transitions. [2018-04-13 00:04:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4588 [2018-04-13 00:04:18,926 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:18,926 INFO L355 BasicCegarLoop]: trace histogram [291, 291, 193, 193, 193, 193, 193, 193, 193, 193, 193, 99, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:18,926 INFO L408 AbstractCegarLoop]: === Iteration 119 === [__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-13 00:04:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1550189005, now seen corresponding path program 96 times [2018-04-13 00:04:18,927 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:19,574 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 398291 backedges. 0 proven. 33467 refuted. 0 times theorem prover too weak. 364824 trivial. 0 not checked. [2018-04-13 00:04:27,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:27,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-13 00:04:27,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 182400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 182400 trivial. 0 not checked. [2018-04-13 00:04:27,783 INFO L182 omatonBuilderFactory]: Interpolants [100865#(<= main_~i~2 35), 100864#(<= main_~i~2 34), 100867#(<= main_~i~2 37), 100866#(<= main_~i~2 36), 100869#(<= main_~i~2 39), 100868#(<= main_~i~2 38), 100871#(<= main_~i~2 41), 100870#(<= main_~i~2 40), 100873#(<= main_~i~2 43), 100872#(<= main_~i~2 42), 100875#(<= main_~i~2 45), 100874#(<= main_~i~2 44), 100877#(<= main_~i~2 47), 100876#(<= main_~i~2 46), 100879#(<= main_~i~2 49), 100878#(<= main_~i~2 48), 100881#(<= main_~i~2 51), 100880#(<= main_~i~2 50), 100883#(<= main_~i~2 53), 100882#(<= main_~i~2 52), 100885#(<= main_~i~2 55), 100884#(<= main_~i~2 54), 100887#(<= main_~i~2 57), 100886#(<= main_~i~2 56), 100889#(<= main_~i~2 59), 100888#(<= main_~i~2 58), 100891#(<= main_~i~2 61), 100890#(<= main_~i~2 60), 100893#(<= main_~i~2 63), 100892#(<= main_~i~2 62), 100895#(<= main_~i~2 65), 100894#(<= main_~i~2 64), 100897#(<= main_~i~2 67), 100896#(<= main_~i~2 66), 100899#(<= main_~i~2 69), 100898#(<= main_~i~2 68), 100901#(<= main_~i~2 71), 100900#(<= main_~i~2 70), 100903#(<= main_~i~2 73), 100902#(<= main_~i~2 72), 100905#(<= main_~i~2 75), 100904#(<= main_~i~2 74), 100907#(<= main_~i~2 77), 100906#(<= main_~i~2 76), 100909#(<= main_~i~2 79), 100908#(<= main_~i~2 78), 100911#(<= main_~i~2 81), 100910#(<= main_~i~2 80), 100913#(<= main_~i~2 83), 100912#(<= main_~i~2 82), 100915#(<= main_~i~2 85), 100914#(<= main_~i~2 84), 100917#(<= main_~i~2 87), 100916#(<= main_~i~2 86), 100919#(<= main_~i~2 89), 100918#(<= main_~i~2 88), 100921#(<= main_~i~2 91), 100920#(<= main_~i~2 90), 100923#(<= main_~i~2 93), 100922#(<= main_~i~2 92), 100925#(<= main_~i~2 95), 100924#(<= main_~i~2 94), 100927#(<= main_~i~2 97), 100926#(<= main_~i~2 96), 100928#(<= main_~i~2 98), 100829#false, 100828#true, 100831#(<= main_~i~2 1), 100830#(= main_~i~2 0), 100833#(<= main_~i~2 3), 100832#(<= main_~i~2 2), 100835#(<= main_~i~2 5), 100834#(<= main_~i~2 4), 100837#(<= main_~i~2 7), 100836#(<= main_~i~2 6), 100839#(<= main_~i~2 9), 100838#(<= main_~i~2 8), 100841#(<= main_~i~2 11), 100840#(<= main_~i~2 10), 100843#(<= main_~i~2 13), 100842#(<= main_~i~2 12), 100845#(<= main_~i~2 15), 100844#(<= main_~i~2 14), 100847#(<= main_~i~2 17), 100846#(<= main_~i~2 16), 100849#(<= main_~i~2 19), 100848#(<= main_~i~2 18), 100851#(<= main_~i~2 21), 100850#(<= main_~i~2 20), 100853#(<= main_~i~2 23), 100852#(<= main_~i~2 22), 100855#(<= main_~i~2 25), 100854#(<= main_~i~2 24), 100857#(<= main_~i~2 27), 100856#(<= main_~i~2 26), 100859#(<= main_~i~2 29), 100858#(<= main_~i~2 28), 100861#(<= main_~i~2 31), 100860#(<= main_~i~2 30), 100863#(<= main_~i~2 33), 100862#(<= main_~i~2 32)] [2018-04-13 00:04:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 398291 backedges. 0 proven. 33467 refuted. 0 times theorem prover too weak. 364824 trivial. 0 not checked. [2018-04-13 00:04:27,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 00:04:27,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 00:04:27,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 00:04:27,788 INFO L87 Difference]: Start difference. First operand 801 states and 901 transitions. Second operand 101 states. [2018-04-13 00:04:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:28,699 INFO L93 Difference]: Finished difference Result 813 states and 915 transitions. [2018-04-13 00:04:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 00:04:28,699 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 4587 [2018-04-13 00:04:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:28,702 INFO L225 Difference]: With dead ends: 813 [2018-04-13 00:04:28,702 INFO L226 Difference]: Without dead ends: 813 [2018-04-13 00:04:28,703 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 00:04:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-04-13 00:04:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 808. [2018-04-13 00:04:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-04-13 00:04:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 909 transitions. [2018-04-13 00:04:28,709 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 909 transitions. Word has length 4587 [2018-04-13 00:04:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:28,711 INFO L459 AbstractCegarLoop]: Abstraction has 808 states and 909 transitions. [2018-04-13 00:04:28,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 00:04:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 909 transitions. [2018-04-13 00:04:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4635 [2018-04-13 00:04:28,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:28,793 INFO L355 BasicCegarLoop]: trace histogram [294, 294, 195, 195, 195, 195, 195, 195, 195, 195, 195, 100, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:28,793 INFO L408 AbstractCegarLoop]: === Iteration 120 === [__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-13 00:04:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1544415539, now seen corresponding path program 97 times [2018-04-13 00:04:28,794 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:29,303 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 406562 backedges. 0 proven. 34155 refuted. 0 times theorem prover too weak. 372407 trivial. 0 not checked. [2018-04-13 00:04:37,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:37,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-13 00:04:37,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 186240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186240 trivial. 0 not checked. [2018-04-13 00:04:37,635 INFO L182 omatonBuilderFactory]: Interpolants [102551#false, 102550#true, 102553#(<= main_~i~2 1), 102552#(= main_~i~2 0), 102555#(<= main_~i~2 3), 102554#(<= main_~i~2 2), 102557#(<= main_~i~2 5), 102556#(<= main_~i~2 4), 102559#(<= main_~i~2 7), 102558#(<= main_~i~2 6), 102561#(<= main_~i~2 9), 102560#(<= main_~i~2 8), 102563#(<= main_~i~2 11), 102562#(<= main_~i~2 10), 102565#(<= main_~i~2 13), 102564#(<= main_~i~2 12), 102567#(<= main_~i~2 15), 102566#(<= main_~i~2 14), 102569#(<= main_~i~2 17), 102568#(<= main_~i~2 16), 102571#(<= main_~i~2 19), 102570#(<= main_~i~2 18), 102573#(<= main_~i~2 21), 102572#(<= main_~i~2 20), 102575#(<= main_~i~2 23), 102574#(<= main_~i~2 22), 102577#(<= main_~i~2 25), 102576#(<= main_~i~2 24), 102579#(<= main_~i~2 27), 102578#(<= main_~i~2 26), 102581#(<= main_~i~2 29), 102580#(<= main_~i~2 28), 102583#(<= main_~i~2 31), 102582#(<= main_~i~2 30), 102585#(<= main_~i~2 33), 102584#(<= main_~i~2 32), 102587#(<= main_~i~2 35), 102586#(<= main_~i~2 34), 102589#(<= main_~i~2 37), 102588#(<= main_~i~2 36), 102591#(<= main_~i~2 39), 102590#(<= main_~i~2 38), 102593#(<= main_~i~2 41), 102592#(<= main_~i~2 40), 102595#(<= main_~i~2 43), 102594#(<= main_~i~2 42), 102597#(<= main_~i~2 45), 102596#(<= main_~i~2 44), 102599#(<= main_~i~2 47), 102598#(<= main_~i~2 46), 102601#(<= main_~i~2 49), 102600#(<= main_~i~2 48), 102603#(<= main_~i~2 51), 102602#(<= main_~i~2 50), 102605#(<= main_~i~2 53), 102604#(<= main_~i~2 52), 102607#(<= main_~i~2 55), 102606#(<= main_~i~2 54), 102609#(<= main_~i~2 57), 102608#(<= main_~i~2 56), 102611#(<= main_~i~2 59), 102610#(<= main_~i~2 58), 102613#(<= main_~i~2 61), 102612#(<= main_~i~2 60), 102615#(<= main_~i~2 63), 102614#(<= main_~i~2 62), 102617#(<= main_~i~2 65), 102616#(<= main_~i~2 64), 102619#(<= main_~i~2 67), 102618#(<= main_~i~2 66), 102621#(<= main_~i~2 69), 102620#(<= main_~i~2 68), 102623#(<= main_~i~2 71), 102622#(<= main_~i~2 70), 102625#(<= main_~i~2 73), 102624#(<= main_~i~2 72), 102627#(<= main_~i~2 75), 102626#(<= main_~i~2 74), 102629#(<= main_~i~2 77), 102628#(<= main_~i~2 76), 102631#(<= main_~i~2 79), 102630#(<= main_~i~2 78), 102633#(<= main_~i~2 81), 102632#(<= main_~i~2 80), 102635#(<= main_~i~2 83), 102634#(<= main_~i~2 82), 102637#(<= main_~i~2 85), 102636#(<= main_~i~2 84), 102639#(<= main_~i~2 87), 102638#(<= main_~i~2 86), 102641#(<= main_~i~2 89), 102640#(<= main_~i~2 88), 102643#(<= main_~i~2 91), 102642#(<= main_~i~2 90), 102645#(<= main_~i~2 93), 102644#(<= main_~i~2 92), 102647#(<= main_~i~2 95), 102646#(<= main_~i~2 94), 102649#(<= main_~i~2 97), 102648#(<= main_~i~2 96), 102651#(<= main_~i~2 99), 102650#(<= main_~i~2 98)] [2018-04-13 00:04:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 406562 backedges. 0 proven. 34155 refuted. 0 times theorem prover too weak. 372407 trivial. 0 not checked. [2018-04-13 00:04:37,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-13 00:04:37,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-13 00:04:37,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 00:04:37,640 INFO L87 Difference]: Start difference. First operand 808 states and 909 transitions. Second operand 102 states. [2018-04-13 00:04:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:38,971 INFO L93 Difference]: Finished difference Result 815 states and 917 transitions. [2018-04-13 00:04:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 00:04:38,971 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 4634 [2018-04-13 00:04:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:38,974 INFO L225 Difference]: With dead ends: 815 [2018-04-13 00:04:38,974 INFO L226 Difference]: Without dead ends: 815 [2018-04-13 00:04:38,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 00:04:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-04-13 00:04:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2018-04-13 00:04:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-04-13 00:04:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 917 transitions. [2018-04-13 00:04:38,982 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 917 transitions. Word has length 4634 [2018-04-13 00:04:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:38,983 INFO L459 AbstractCegarLoop]: Abstraction has 815 states and 917 transitions. [2018-04-13 00:04:38,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-13 00:04:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 917 transitions. [2018-04-13 00:04:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4682 [2018-04-13 00:04:39,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:39,060 INFO L355 BasicCegarLoop]: trace histogram [297, 297, 197, 197, 197, 197, 197, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:39,060 INFO L408 AbstractCegarLoop]: === Iteration 121 === [__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-13 00:04:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 195845875, now seen corresponding path program 98 times [2018-04-13 00:04:39,061 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:39,616 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 414918 backedges. 4809 proven. 10 refuted. 0 times theorem prover too weak. 410099 trivial. 0 not checked. [2018-04-13 00:04:45,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:45,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 00:04:45,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 190120 backedges. 2231 proven. 0 refuted. 0 times theorem prover too weak. 187889 trivial. 0 not checked. [2018-04-13 00:04:45,462 INFO L182 omatonBuilderFactory]: Interpolants [104289#(<= main_~i~2 2), 104288#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 104290#(<= main_~i~2 3), 104283#false, 104282#true, 104285#(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)), 104284#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 104287#(<= (+ |__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 2)), 104286#(<= (+ |__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))] [2018-04-13 00:04:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 414918 backedges. 4809 proven. 10 refuted. 0 times theorem prover too weak. 410099 trivial. 0 not checked. [2018-04-13 00:04:45,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 00:04:45,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 00:04:45,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-13 00:04:45,466 INFO L87 Difference]: Start difference. First operand 815 states and 917 transitions. Second operand 9 states. [2018-04-13 00:04:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:45,575 INFO L93 Difference]: Finished difference Result 1907 states and 2303 transitions. [2018-04-13 00:04:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 00:04:45,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 4681 [2018-04-13 00:04:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:45,585 INFO L225 Difference]: With dead ends: 1907 [2018-04-13 00:04:45,586 INFO L226 Difference]: Without dead ends: 1907 [2018-04-13 00:04:45,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:04:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2018-04-13 00:04:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 830. [2018-04-13 00:04:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-13 00:04:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1032 transitions. [2018-04-13 00:04:45,604 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1032 transitions. Word has length 4681 [2018-04-13 00:04:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:45,605 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1032 transitions. [2018-04-13 00:04:45,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 00:04:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1032 transitions. [2018-04-13 00:04:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4688 [2018-04-13 00:04:45,684 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:45,684 INFO L355 BasicCegarLoop]: trace histogram [298, 297, 198, 198, 198, 198, 198, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:45,684 INFO L408 AbstractCegarLoop]: === Iteration 122 === [__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-13 00:04:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2067224009, now seen corresponding path program 99 times [2018-04-13 00:04:45,685 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:46,287 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 416300 backedges. 5449 proven. 73 refuted. 0 times theorem prover too weak. 410778 trivial. 0 not checked. [2018-04-13 00:04:52,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:52,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 00:04:52,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 189441 backedges. 2208 proven. 16 refuted. 0 times theorem prover too weak. 187217 trivial. 0 not checked. [2018-04-13 00:04:52,174 INFO L182 omatonBuilderFactory]: Interpolants [107041#false, 107040#true, 107043#(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)), 107042#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 107045#(<= (+ |__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 2)), 107044#(<= (+ |__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)), 107047#(<= main_~i~2 2), 107046#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 107049#(<= main_~i~2 4), 107048#(<= main_~i~2 3)] [2018-04-13 00:04:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 416300 backedges. 5449 proven. 73 refuted. 0 times theorem prover too weak. 410778 trivial. 0 not checked. [2018-04-13 00:04:52,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 00:04:52,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 00:04:52,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-13 00:04:52,179 INFO L87 Difference]: Start difference. First operand 830 states and 1032 transitions. Second operand 10 states. [2018-04-13 00:04:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:52,308 INFO L93 Difference]: Finished difference Result 2575 states and 3163 transitions. [2018-04-13 00:04:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 00:04:52,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 4687 [2018-04-13 00:04:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:52,321 INFO L225 Difference]: With dead ends: 2575 [2018-04-13 00:04:52,321 INFO L226 Difference]: Without dead ends: 2575 [2018-04-13 00:04:52,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:04:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2018-04-13 00:04:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 830. [2018-04-13 00:04:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-13 00:04:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1032 transitions. [2018-04-13 00:04:52,347 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1032 transitions. Word has length 4687 [2018-04-13 00:04:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:52,349 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1032 transitions. [2018-04-13 00:04:52,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 00:04:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1032 transitions. [2018-04-13 00:04:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4694 [2018-04-13 00:04:52,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:52,442 INFO L355 BasicCegarLoop]: trace histogram [299, 297, 199, 199, 199, 199, 199, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:52,442 INFO L408 AbstractCegarLoop]: === Iteration 123 === [__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-13 00:04:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1895525325, now seen corresponding path program 100 times [2018-04-13 00:04:52,442 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:52,979 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:04:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 417688 backedges. 6197 proven. 24 refuted. 0 times theorem prover too weak. 411467 trivial. 0 not checked. [2018-04-13 00:04:58,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:04:58,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 00:04:58,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:04:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 188782 backedges. 1565 proven. 0 refuted. 0 times theorem prover too weak. 187217 trivial. 0 not checked. [2018-04-13 00:04:58,930 INFO L182 omatonBuilderFactory]: Interpolants [110467#true, 110469#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 110468#false, 110471#(<= (+ |__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)), 110470#(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)), 110473#(<= (+ |__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 3)), 110472#(<= (+ |__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 2)), 110475#(<= main_~i~2 3), 110474#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 110476#(<= main_~i~2 4)] [2018-04-13 00:04:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 417688 backedges. 6197 proven. 24 refuted. 0 times theorem prover too weak. 411467 trivial. 0 not checked. [2018-04-13 00:04:58,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 00:04:58,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 00:04:58,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-13 00:04:58,935 INFO L87 Difference]: Start difference. First operand 830 states and 1032 transitions. Second operand 10 states. [2018-04-13 00:04:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:04:59,081 INFO L93 Difference]: Finished difference Result 1922 states and 2515 transitions. [2018-04-13 00:04:59,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 00:04:59,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 4693 [2018-04-13 00:04:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:04:59,089 INFO L225 Difference]: With dead ends: 1922 [2018-04-13 00:04:59,089 INFO L226 Difference]: Without dead ends: 1922 [2018-04-13 00:04:59,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-04-13 00:04:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-04-13 00:04:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 845. [2018-04-13 00:04:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-04-13 00:04:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1147 transitions. [2018-04-13 00:04:59,107 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1147 transitions. Word has length 4693 [2018-04-13 00:04:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:04:59,109 INFO L459 AbstractCegarLoop]: Abstraction has 845 states and 1147 transitions. [2018-04-13 00:04:59,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 00:04:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1147 transitions. [2018-04-13 00:04:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4700 [2018-04-13 00:04:59,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:04:59,192 INFO L355 BasicCegarLoop]: trace histogram [300, 297, 200, 200, 200, 200, 200, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:04:59,192 INFO L408 AbstractCegarLoop]: === Iteration 124 === [__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-13 00:04:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 6462217, now seen corresponding path program 101 times [2018-04-13 00:04:59,193 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:04:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:04:59,688 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 419082 backedges. 6075 proven. 157 refuted. 0 times theorem prover too weak. 412850 trivial. 0 not checked. [2018-04-13 00:05:05,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:05,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 00:05:05,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 188775 backedges. 2185 proven. 32 refuted. 0 times theorem prover too weak. 186558 trivial. 0 not checked. [2018-04-13 00:05:05,769 INFO L182 omatonBuilderFactory]: Interpolants [113265#(<= (+ |__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 2)), 113264#(<= (+ |__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)), 113267#(<= main_~i~2 2), 113266#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 113269#(<= main_~i~2 4), 113268#(<= main_~i~2 3), 113270#(<= main_~i~2 5), 113261#false, 113260#true, 113263#(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)), 113262#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)] [2018-04-13 00:05:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 419082 backedges. 6075 proven. 157 refuted. 0 times theorem prover too weak. 412850 trivial. 0 not checked. [2018-04-13 00:05:05,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 00:05:05,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 00:05:05,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-13 00:05:05,773 INFO L87 Difference]: Start difference. First operand 845 states and 1147 transitions. Second operand 11 states. [2018-04-13 00:05:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:05,898 INFO L93 Difference]: Finished difference Result 3240 states and 4403 transitions. [2018-04-13 00:05:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 00:05:05,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 4699 [2018-04-13 00:05:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:05,912 INFO L225 Difference]: With dead ends: 3240 [2018-04-13 00:05:05,912 INFO L226 Difference]: Without dead ends: 3240 [2018-04-13 00:05:05,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-04-13 00:05:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2018-04-13 00:05:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 845. [2018-04-13 00:05:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-04-13 00:05:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1147 transitions. [2018-04-13 00:05:05,938 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1147 transitions. Word has length 4699 [2018-04-13 00:05:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:05,939 INFO L459 AbstractCegarLoop]: Abstraction has 845 states and 1147 transitions. [2018-04-13 00:05:05,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 00:05:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1147 transitions. [2018-04-13 00:05:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4706 [2018-04-13 00:05:06,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:06,019 INFO L355 BasicCegarLoop]: trace histogram [301, 297, 201, 201, 201, 201, 201, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:06,019 INFO L408 AbstractCegarLoop]: === Iteration 125 === [__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-13 00:05:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1428827615, now seen corresponding path program 102 times [2018-04-13 00:05:06,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:06,577 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420482 backedges. 6823 proven. 127 refuted. 0 times theorem prover too weak. 413532 trivial. 0 not checked. [2018-04-13 00:05:12,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:12,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 00:05:12,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 188129 backedges. 1549 proven. 22 refuted. 0 times theorem prover too weak. 186558 trivial. 0 not checked. [2018-04-13 00:05:12,636 INFO L182 omatonBuilderFactory]: Interpolants [117377#(<= main_~i~2 4), 117376#(<= main_~i~2 3), 117378#(<= main_~i~2 5), 117369#false, 117368#true, 117371#(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)), 117370#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 117373#(<= (+ |__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 2)), 117372#(<= (+ |__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)), 117375#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 117374#(<= (+ |__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 3))] [2018-04-13 00:05:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 420482 backedges. 6823 proven. 127 refuted. 0 times theorem prover too weak. 413532 trivial. 0 not checked. [2018-04-13 00:05:12,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 00:05:12,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 00:05:12,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-13 00:05:12,641 INFO L87 Difference]: Start difference. First operand 845 states and 1147 transitions. Second operand 11 states. [2018-04-13 00:05:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:12,799 INFO L93 Difference]: Finished difference Result 2590 states and 3471 transitions. [2018-04-13 00:05:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 00:05:12,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 4705 [2018-04-13 00:05:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:12,809 INFO L225 Difference]: With dead ends: 2590 [2018-04-13 00:05:12,809 INFO L226 Difference]: Without dead ends: 2590 [2018-04-13 00:05:12,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-04-13 00:05:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-04-13 00:05:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 845. [2018-04-13 00:05:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-04-13 00:05:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1147 transitions. [2018-04-13 00:05:12,834 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1147 transitions. Word has length 4705 [2018-04-13 00:05:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:12,835 INFO L459 AbstractCegarLoop]: Abstraction has 845 states and 1147 transitions. [2018-04-13 00:05:12,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 00:05:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1147 transitions. [2018-04-13 00:05:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4712 [2018-04-13 00:05:12,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:12,924 INFO L355 BasicCegarLoop]: trace histogram [302, 297, 202, 202, 202, 202, 202, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:12,924 INFO L408 AbstractCegarLoop]: === Iteration 126 === [__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-13 00:05:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash 810230985, now seen corresponding path program 103 times [2018-04-13 00:05:12,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:13,484 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 421888 backedges. 7623 proven. 44 refuted. 0 times theorem prover too weak. 414221 trivial. 0 not checked. [2018-04-13 00:05:19,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:19,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 00:05:19,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 188135 backedges. 1577 proven. 0 refuted. 0 times theorem prover too weak. 186558 trivial. 0 not checked. [2018-04-13 00:05:19,515 INFO L182 omatonBuilderFactory]: Interpolants [120833#(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)), 120832#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 120835#(<= (+ |__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 2)), 120834#(<= (+ |__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)), 120837#(<= (+ |__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 4)), 120836#(<= (+ |__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 3)), 120839#(<= main_~i~2 4), 120838#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 120840#(<= main_~i~2 5), 120831#false, 120830#true] [2018-04-13 00:05:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 421888 backedges. 7623 proven. 44 refuted. 0 times theorem prover too weak. 414221 trivial. 0 not checked. [2018-04-13 00:05:19,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 00:05:19,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 00:05:19,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-13 00:05:19,520 INFO L87 Difference]: Start difference. First operand 845 states and 1147 transitions. Second operand 11 states. [2018-04-13 00:05:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:19,654 INFO L93 Difference]: Finished difference Result 1937 states and 2727 transitions. [2018-04-13 00:05:19,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 00:05:19,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 4711 [2018-04-13 00:05:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:19,661 INFO L225 Difference]: With dead ends: 1937 [2018-04-13 00:05:19,661 INFO L226 Difference]: Without dead ends: 1937 [2018-04-13 00:05:19,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2018-04-13 00:05:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-04-13 00:05:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 860. [2018-04-13 00:05:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-04-13 00:05:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1262 transitions. [2018-04-13 00:05:19,682 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1262 transitions. Word has length 4711 [2018-04-13 00:05:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:19,683 INFO L459 AbstractCegarLoop]: Abstraction has 860 states and 1262 transitions. [2018-04-13 00:05:19,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 00:05:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1262 transitions. [2018-04-13 00:05:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4718 [2018-04-13 00:05:19,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:19,763 INFO L355 BasicCegarLoop]: trace histogram [303, 297, 203, 203, 203, 203, 203, 197, 197, 197, 197, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:19,763 INFO L408 AbstractCegarLoop]: === Iteration 127 === [__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-13 00:05:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1788615905, now seen corresponding path program 104 times [2018-04-13 00:05:19,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:20,271 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 423300 backedges. 12240 proven. 9 refuted. 0 times theorem prover too weak. 411051 trivial. 0 not checked. [2018-04-13 00:05:26,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:26,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 00:05:26,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 188128 backedges. 3025 proven. 0 refuted. 0 times theorem prover too weak. 185103 trivial. 0 not checked. [2018-04-13 00:05:26,511 INFO L182 omatonBuilderFactory]: Interpolants [123665#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 123664#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 2), 123667#(<= main_~i~2 3), 123666#(<= main_~i~2 2), 123659#false, 123658#true, 123661#(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)), 123660#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 123663#(<= (+ |__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 2)), 123662#(<= (+ |__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))] [2018-04-13 00:05:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 423300 backedges. 12240 proven. 9 refuted. 0 times theorem prover too weak. 411051 trivial. 0 not checked. [2018-04-13 00:05:26,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 00:05:26,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 00:05:26,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 00:05:26,516 INFO L87 Difference]: Start difference. First operand 860 states and 1262 transitions. Second operand 10 states. [2018-04-13 00:05:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:26,609 INFO L93 Difference]: Finished difference Result 1976 states and 3550 transitions. [2018-04-13 00:05:26,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 00:05:26,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 4717 [2018-04-13 00:05:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:26,622 INFO L225 Difference]: With dead ends: 1976 [2018-04-13 00:05:26,622 INFO L226 Difference]: Without dead ends: 1976 [2018-04-13 00:05:26,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:05:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2018-04-13 00:05:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 868. [2018-04-13 00:05:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-04-13 00:05:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1274 transitions. [2018-04-13 00:05:26,653 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1274 transitions. Word has length 4717 [2018-04-13 00:05:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:26,655 INFO L459 AbstractCegarLoop]: Abstraction has 868 states and 1274 transitions. [2018-04-13 00:05:26,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 00:05:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1274 transitions. [2018-04-13 00:05:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4723 [2018-04-13 00:05:26,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:26,782 INFO L355 BasicCegarLoop]: trace histogram [303, 298, 203, 203, 203, 203, 203, 198, 198, 198, 198, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:26,782 INFO L408 AbstractCegarLoop]: === Iteration 128 === [__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-13 00:05:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1473643290, now seen corresponding path program 105 times [2018-04-13 00:05:26,783 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:27,281 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 424485 backedges. 6687 proven. 262 refuted. 0 times theorem prover too weak. 417536 trivial. 0 not checked. [2018-04-13 00:05:33,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:33,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 00:05:33,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 187837 backedges. 2162 proven. 48 refuted. 0 times theorem prover too weak. 185627 trivial. 0 not checked. [2018-04-13 00:05:33,411 INFO L182 omatonBuilderFactory]: Interpolants [126529#(<= main_~i~2 4), 126528#(<= main_~i~2 3), 126531#(<= main_~i~2 6), 126530#(<= main_~i~2 5), 126521#false, 126520#true, 126523#(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)), 126522#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 126525#(<= (+ |__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 2)), 126524#(<= (+ |__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)), 126527#(<= main_~i~2 2), 126526#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2)] [2018-04-13 00:05:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 424485 backedges. 6687 proven. 262 refuted. 0 times theorem prover too weak. 417536 trivial. 0 not checked. [2018-04-13 00:05:33,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 00:05:33,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 00:05:33,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-04-13 00:05:33,415 INFO L87 Difference]: Start difference. First operand 868 states and 1274 transitions. Second operand 12 states. [2018-04-13 00:05:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:33,536 INFO L93 Difference]: Finished difference Result 3903 states and 5825 transitions. [2018-04-13 00:05:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 00:05:33,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 4722 [2018-04-13 00:05:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:33,550 INFO L225 Difference]: With dead ends: 3903 [2018-04-13 00:05:33,550 INFO L226 Difference]: Without dead ends: 3903 [2018-04-13 00:05:33,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-04-13 00:05:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3903 states. [2018-04-13 00:05:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3903 to 868. [2018-04-13 00:05:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-04-13 00:05:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1274 transitions. [2018-04-13 00:05:33,605 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1274 transitions. Word has length 4722 [2018-04-13 00:05:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:33,607 INFO L459 AbstractCegarLoop]: Abstraction has 868 states and 1274 transitions. [2018-04-13 00:05:33,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 00:05:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1274 transitions. [2018-04-13 00:05:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4729 [2018-04-13 00:05:33,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:33,730 INFO L355 BasicCegarLoop]: trace histogram [304, 298, 204, 204, 204, 204, 204, 198, 198, 198, 198, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:33,730 INFO L408 AbstractCegarLoop]: === Iteration 129 === [__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-13 00:05:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1817206288, now seen corresponding path program 106 times [2018-04-13 00:05:33,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:34,282 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 425903 backedges. 7435 proven. 257 refuted. 0 times theorem prover too weak. 418211 trivial. 0 not checked. [2018-04-13 00:05:40,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:40,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 00:05:40,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 187204 backedges. 1533 proven. 44 refuted. 0 times theorem prover too weak. 185627 trivial. 0 not checked. [2018-04-13 00:05:40,392 INFO L182 omatonBuilderFactory]: Interpolants [131315#true, 131318#(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)), 131319#(<= (+ |__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)), 131316#false, 131317#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 131322#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 131323#(<= main_~i~2 3), 131320#(<= (+ |__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 2)), 131321#(<= (+ |__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 3)), 131326#(<= main_~i~2 6), 131324#(<= main_~i~2 4), 131325#(<= main_~i~2 5)] [2018-04-13 00:05:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 425903 backedges. 7435 proven. 257 refuted. 0 times theorem prover too weak. 418211 trivial. 0 not checked. [2018-04-13 00:05:40,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 00:05:40,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 00:05:40,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-13 00:05:40,397 INFO L87 Difference]: Start difference. First operand 868 states and 1274 transitions. Second operand 12 states. [2018-04-13 00:05:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:40,544 INFO L93 Difference]: Finished difference Result 3263 states and 4817 transitions. [2018-04-13 00:05:40,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 00:05:40,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 4728 [2018-04-13 00:05:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:40,556 INFO L225 Difference]: With dead ends: 3263 [2018-04-13 00:05:40,556 INFO L226 Difference]: Without dead ends: 3263 [2018-04-13 00:05:40,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-04-13 00:05:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2018-04-13 00:05:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 868. [2018-04-13 00:05:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-04-13 00:05:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1274 transitions. [2018-04-13 00:05:40,585 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1274 transitions. Word has length 4728 [2018-04-13 00:05:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:40,586 INFO L459 AbstractCegarLoop]: Abstraction has 868 states and 1274 transitions. [2018-04-13 00:05:40,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 00:05:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1274 transitions. [2018-04-13 00:05:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4735 [2018-04-13 00:05:40,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:40,664 INFO L355 BasicCegarLoop]: trace histogram [305, 298, 205, 205, 205, 205, 205, 198, 198, 198, 198, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:40,664 INFO L408 AbstractCegarLoop]: === Iteration 130 === [__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-13 00:05:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1508358694, now seen corresponding path program 107 times [2018-04-13 00:05:40,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:41,315 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 427327 backedges. 8235 proven. 199 refuted. 0 times theorem prover too weak. 418893 trivial. 0 not checked. [2018-04-13 00:05:47,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:47,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 00:05:47,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 187216 backedges. 1561 proven. 28 refuted. 0 times theorem prover too weak. 185627 trivial. 0 not checked. [2018-04-13 00:05:47,497 INFO L182 omatonBuilderFactory]: Interpolants [135474#true, 135475#false, 135478#(<= (+ |__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)), 135479#(<= (+ |__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 2)), 135476#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 135477#(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)), 135482#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 135483#(<= main_~i~2 4), 135480#(<= (+ |__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 3)), 135481#(<= (+ |__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 4)), 135484#(<= main_~i~2 5), 135485#(<= main_~i~2 6)] [2018-04-13 00:05:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 427327 backedges. 8235 proven. 199 refuted. 0 times theorem prover too weak. 418893 trivial. 0 not checked. [2018-04-13 00:05:47,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 00:05:47,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 00:05:47,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-04-13 00:05:47,501 INFO L87 Difference]: Start difference. First operand 868 states and 1274 transitions. Second operand 12 states. [2018-04-13 00:05:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:47,653 INFO L93 Difference]: Finished difference Result 2621 states and 4090 transitions. [2018-04-13 00:05:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 00:05:47,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 4734 [2018-04-13 00:05:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:47,663 INFO L225 Difference]: With dead ends: 2621 [2018-04-13 00:05:47,663 INFO L226 Difference]: Without dead ends: 2621 [2018-04-13 00:05:47,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-04-13 00:05:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2018-04-13 00:05:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 876. [2018-04-13 00:05:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-04-13 00:05:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1380 transitions. [2018-04-13 00:05:47,707 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1380 transitions. Word has length 4734 [2018-04-13 00:05:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:47,708 INFO L459 AbstractCegarLoop]: Abstraction has 876 states and 1380 transitions. [2018-04-13 00:05:47,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 00:05:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1380 transitions. [2018-04-13 00:05:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4741 [2018-04-13 00:05:47,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:47,816 INFO L355 BasicCegarLoop]: trace histogram [306, 298, 206, 206, 206, 206, 206, 198, 198, 198, 198, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:47,816 INFO L408 AbstractCegarLoop]: === Iteration 131 === [__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-13 00:05:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash 437104688, now seen corresponding path program 108 times [2018-04-13 00:05:47,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:48,325 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:05:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 428757 backedges. 12805 proven. 241 refuted. 0 times theorem prover too weak. 415711 trivial. 0 not checked. [2018-04-13 00:05:54,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:05:54,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 00:05:54,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:05:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 187216 backedges. 2994 proven. 47 refuted. 0 times theorem prover too weak. 184175 trivial. 0 not checked. [2018-04-13 00:05:54,897 INFO L182 omatonBuilderFactory]: Interpolants [139010#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 139011#(<= main_~i~2 2), 139008#(<= (+ |__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 2)), 139009#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 2), 139012#(<= main_~i~2 3), 139013#(<= main_~i~2 4), 139003#true, 139006#(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)), 139007#(<= (+ |__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)), 139004#false, 139005#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)] [2018-04-13 00:05:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 428757 backedges. 12805 proven. 241 refuted. 0 times theorem prover too weak. 415711 trivial. 0 not checked. [2018-04-13 00:05:54,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 00:05:54,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 00:05:54,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-13 00:05:54,902 INFO L87 Difference]: Start difference. First operand 876 states and 1380 transitions. Second operand 11 states. [2018-04-13 00:05:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:05:55,066 INFO L93 Difference]: Finished difference Result 2644 states and 4986 transitions. [2018-04-13 00:05:55,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 00:05:55,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 4740 [2018-04-13 00:05:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:05:55,083 INFO L225 Difference]: With dead ends: 2644 [2018-04-13 00:05:55,083 INFO L226 Difference]: Without dead ends: 2644 [2018-04-13 00:05:55,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:05:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-04-13 00:05:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 868. [2018-04-13 00:05:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-04-13 00:05:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1274 transitions. [2018-04-13 00:05:55,136 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1274 transitions. Word has length 4740 [2018-04-13 00:05:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:05:55,138 INFO L459 AbstractCegarLoop]: Abstraction has 868 states and 1274 transitions. [2018-04-13 00:05:55,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 00:05:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1274 transitions. [2018-04-13 00:05:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4746 [2018-04-13 00:05:55,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:05:55,233 INFO L355 BasicCegarLoop]: trace histogram [306, 299, 206, 206, 206, 206, 206, 199, 199, 199, 199, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:05:55,233 INFO L408 AbstractCegarLoop]: === Iteration 132 === [__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-13 00:05:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1970334071, now seen corresponding path program 109 times [2018-04-13 00:05:55,233 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:05:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:05:55,834 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 429947 backedges. 9105 proven. 70 refuted. 0 times theorem prover too weak. 420772 trivial. 0 not checked. [2018-04-13 00:06:02,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:02,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 00:06:02,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 186942 backedges. 1595 proven. 0 refuted. 0 times theorem prover too weak. 185347 trivial. 0 not checked. [2018-04-13 00:06:02,315 INFO L182 omatonBuilderFactory]: Interpolants [142544#(<= main_~i~2 5), 142545#(<= main_~i~2 6), 142534#true, 142535#false, 142538#(<= (+ |__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)), 142539#(<= (+ |__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 2)), 142536#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 142537#(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)), 142542#(<= (+ |__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 5)), 142543#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 142540#(<= (+ |__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 3)), 142541#(<= (+ |__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 4))] [2018-04-13 00:06:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 429947 backedges. 9105 proven. 70 refuted. 0 times theorem prover too weak. 420772 trivial. 0 not checked. [2018-04-13 00:06:02,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 00:06:02,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 00:06:02,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-04-13 00:06:02,320 INFO L87 Difference]: Start difference. First operand 868 states and 1274 transitions. Second operand 12 states. [2018-04-13 00:06:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:02,486 INFO L93 Difference]: Finished difference Result 1976 states and 3358 transitions. [2018-04-13 00:06:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 00:06:02,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 4745 [2018-04-13 00:06:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:02,494 INFO L225 Difference]: With dead ends: 1976 [2018-04-13 00:06:02,495 INFO L226 Difference]: Without dead ends: 1976 [2018-04-13 00:06:02,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2018-04-13 00:06:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2018-04-13 00:06:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 883. [2018-04-13 00:06:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-04-13 00:06:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1390 transitions. [2018-04-13 00:06:02,516 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1390 transitions. Word has length 4745 [2018-04-13 00:06:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:02,517 INFO L459 AbstractCegarLoop]: Abstraction has 883 states and 1390 transitions. [2018-04-13 00:06:02,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 00:06:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1390 transitions. [2018-04-13 00:06:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4752 [2018-04-13 00:06:02,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:02,596 INFO L355 BasicCegarLoop]: trace histogram [307, 299, 207, 207, 207, 207, 207, 199, 199, 199, 199, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:02,596 INFO L408 AbstractCegarLoop]: === Iteration 133 === [__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-13 00:06:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -719192159, now seen corresponding path program 110 times [2018-04-13 00:06:02,597 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:03,351 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 431383 backedges. 14930 proven. 21 refuted. 0 times theorem prover too weak. 416432 trivial. 0 not checked. [2018-04-13 00:06:09,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:09,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 00:06:09,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 186935 backedges. 2760 proven. 0 refuted. 0 times theorem prover too weak. 184175 trivial. 0 not checked. [2018-04-13 00:06:09,440 INFO L182 omatonBuilderFactory]: Interpolants [145430#false, 145431#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 145429#true, 145434#(<= (+ |__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 2)), 145435#(<= (+ |__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 3)), 145432#(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)), 145433#(<= (+ |__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)), 145438#(<= main_~i~2 3), 145439#(<= main_~i~2 4), 145436#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 3), 145437#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3)] [2018-04-13 00:06:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 431383 backedges. 14930 proven. 21 refuted. 0 times theorem prover too weak. 416432 trivial. 0 not checked. [2018-04-13 00:06:09,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 00:06:09,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 00:06:09,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-13 00:06:09,445 INFO L87 Difference]: Start difference. First operand 883 states and 1390 transitions. Second operand 11 states. [2018-04-13 00:06:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:09,545 INFO L93 Difference]: Finished difference Result 2007 states and 3979 transitions. [2018-04-13 00:06:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 00:06:09,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 4751 [2018-04-13 00:06:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:09,555 INFO L225 Difference]: With dead ends: 2007 [2018-04-13 00:06:09,555 INFO L226 Difference]: Without dead ends: 2007 [2018-04-13 00:06:09,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:06:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2018-04-13 00:06:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 891. [2018-04-13 00:06:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-13 00:06:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1403 transitions. [2018-04-13 00:06:09,584 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1403 transitions. Word has length 4751 [2018-04-13 00:06:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:09,585 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1403 transitions. [2018-04-13 00:06:09,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 00:06:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1403 transitions. [2018-04-13 00:06:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4757 [2018-04-13 00:06:09,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:09,664 INFO L355 BasicCegarLoop]: trace histogram [307, 300, 207, 207, 207, 207, 207, 200, 200, 200, 200, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:09,664 INFO L408 AbstractCegarLoop]: === Iteration 134 === [__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-13 00:06:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash -463509544, now seen corresponding path program 111 times [2018-04-13 00:06:09,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:10,219 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 432578 backedges. 7285 proven. 388 refuted. 0 times theorem prover too weak. 424905 trivial. 0 not checked. [2018-04-13 00:06:18,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:18,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:06:18,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 186932 backedges. 2139 proven. 64 refuted. 0 times theorem prover too weak. 184729 trivial. 0 not checked. [2018-04-13 00:06:18,548 INFO L182 omatonBuilderFactory]: Interpolants [148354#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 148355#(<= main_~i~2 2), 148352#(<= (+ |__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)), 148353#(<= (+ |__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 2)), 148358#(<= main_~i~2 5), 148359#(<= main_~i~2 6), 148356#(<= main_~i~2 3), 148357#(<= main_~i~2 4), 148360#(<= main_~i~2 7), 148350#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 148351#(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)), 148348#true, 148349#false] [2018-04-13 00:06:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 432578 backedges. 7285 proven. 388 refuted. 0 times theorem prover too weak. 424905 trivial. 0 not checked. [2018-04-13 00:06:18,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:06:18,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:06:18,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:06:18,552 INFO L87 Difference]: Start difference. First operand 891 states and 1403 transitions. Second operand 13 states. [2018-04-13 00:06:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:18,714 INFO L93 Difference]: Finished difference Result 4552 states and 7409 transitions. [2018-04-13 00:06:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 00:06:18,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4756 [2018-04-13 00:06:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:18,733 INFO L225 Difference]: With dead ends: 4552 [2018-04-13 00:06:18,733 INFO L226 Difference]: Without dead ends: 4552 [2018-04-13 00:06:18,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-04-13 00:06:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2018-04-13 00:06:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 891. [2018-04-13 00:06:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-13 00:06:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1403 transitions. [2018-04-13 00:06:18,780 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1403 transitions. Word has length 4756 [2018-04-13 00:06:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:18,781 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1403 transitions. [2018-04-13 00:06:18,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:06:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1403 transitions. [2018-04-13 00:06:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4763 [2018-04-13 00:06:18,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:18,860 INFO L355 BasicCegarLoop]: trace histogram [308, 300, 208, 208, 208, 208, 208, 200, 200, 200, 200, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:18,860 INFO L408 AbstractCegarLoop]: === Iteration 135 === [__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-13 00:06:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -227093438, now seen corresponding path program 112 times [2018-04-13 00:06:18,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:19,526 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 434020 backedges. 11707 proven. 618 refuted. 0 times theorem prover too weak. 421695 trivial. 0 not checked. [2018-04-13 00:06:26,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:26,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:06:26,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 186312 backedges. 2883 proven. 149 refuted. 0 times theorem prover too weak. 183280 trivial. 0 not checked. [2018-04-13 00:06:26,508 INFO L182 omatonBuilderFactory]: Interpolants [153826#(<= (+ |__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)), 153827#(<= (+ |__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 2)), 153824#(or (not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)) (<= 3 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)), 153825#(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)), 153828#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 2), 153829#(not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)), 153818#(= 0 |main_~#b~0.offset|), 153819#(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)), 153816#true, 153817#false, 153822#(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_~i~1))))), 153823#(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)) (<= 12 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size))))), 153820#(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))))), 153821#(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)))))] [2018-04-13 00:06:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 434020 backedges. 11707 proven. 618 refuted. 0 times theorem prover too weak. 421695 trivial. 0 not checked. [2018-04-13 00:06:26,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:06:26,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:06:26,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:06:26,512 INFO L87 Difference]: Start difference. First operand 891 states and 1403 transitions. Second operand 14 states. [2018-04-13 00:06:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:26,670 INFO L93 Difference]: Finished difference Result 907 states and 1419 transitions. [2018-04-13 00:06:26,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 00:06:26,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4762 [2018-04-13 00:06:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:26,676 INFO L225 Difference]: With dead ends: 907 [2018-04-13 00:06:26,676 INFO L226 Difference]: Without dead ends: 891 [2018-04-13 00:06:26,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-04-13 00:06:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-04-13 00:06:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2018-04-13 00:06:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-13 00:06:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1399 transitions. [2018-04-13 00:06:26,689 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1399 transitions. Word has length 4762 [2018-04-13 00:06:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:26,691 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1399 transitions. [2018-04-13 00:06:26,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:06:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1399 transitions. [2018-04-13 00:06:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4778 [2018-04-13 00:06:26,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:26,780 INFO L355 BasicCegarLoop]: trace histogram [308, 303, 208, 208, 208, 208, 208, 203, 203, 203, 203, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:26,780 INFO L408 AbstractCegarLoop]: === Iteration 136 === [__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-13 00:06:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash -735717727, now seen corresponding path program 113 times [2018-04-13 00:06:26,781 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:27,331 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 437635 backedges. 8033 proven. 414 refuted. 0 times theorem prover too weak. 429188 trivial. 0 not checked. [2018-04-13 00:06:33,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:33,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:06:33,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 185529 backedges. 1517 proven. 66 refuted. 0 times theorem prover too weak. 183946 trivial. 0 not checked. [2018-04-13 00:06:33,545 INFO L182 omatonBuilderFactory]: Interpolants [155650#(<= main_~i~2 7), 155648#(<= main_~i~2 5), 155649#(<= main_~i~2 6), 155638#true, 155639#false, 155642#(<= (+ |__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)), 155643#(<= (+ |__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 2)), 155640#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 155641#(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)), 155646#(<= main_~i~2 3), 155647#(<= main_~i~2 4), 155644#(<= (+ |__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 3)), 155645#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3)] [2018-04-13 00:06:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 437635 backedges. 8033 proven. 414 refuted. 0 times theorem prover too weak. 429188 trivial. 0 not checked. [2018-04-13 00:06:33,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:06:33,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:06:33,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:06:33,549 INFO L87 Difference]: Start difference. First operand 891 states and 1399 transitions. Second operand 13 states. [2018-04-13 00:06:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:33,717 INFO L93 Difference]: Finished difference Result 3926 states and 6329 transitions. [2018-04-13 00:06:33,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 00:06:33,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4777 [2018-04-13 00:06:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:33,740 INFO L225 Difference]: With dead ends: 3926 [2018-04-13 00:06:33,740 INFO L226 Difference]: Without dead ends: 3926 [2018-04-13 00:06:33,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-04-13 00:06:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2018-04-13 00:06:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 891. [2018-04-13 00:06:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-13 00:06:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1399 transitions. [2018-04-13 00:06:33,801 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1399 transitions. Word has length 4777 [2018-04-13 00:06:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:33,803 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1399 transitions. [2018-04-13 00:06:33,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:06:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1399 transitions. [2018-04-13 00:06:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4784 [2018-04-13 00:06:33,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:33,933 INFO L355 BasicCegarLoop]: trace histogram [309, 303, 209, 209, 209, 209, 209, 203, 203, 203, 203, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:33,933 INFO L408 AbstractCegarLoop]: === Iteration 137 === [__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-13 00:06:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 890639927, now seen corresponding path program 114 times [2018-04-13 00:06:33,934 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:34,397 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 439083 backedges. 8833 proven. 387 refuted. 0 times theorem prover too weak. 429863 trivial. 0 not checked. [2018-04-13 00:06:40,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:40,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:06:40,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 185547 backedges. 1545 proven. 56 refuted. 0 times theorem prover too weak. 183946 trivial. 0 not checked. [2018-04-13 00:06:40,658 INFO L182 omatonBuilderFactory]: Interpolants [160486#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 160487#(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)), 160484#true, 160485#false, 160490#(<= (+ |__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 3)), 160491#(<= (+ |__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 4)), 160488#(<= (+ |__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)), 160489#(<= (+ |__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 2)), 160494#(<= main_~i~2 5), 160495#(<= main_~i~2 6), 160492#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 160493#(<= main_~i~2 4), 160496#(<= main_~i~2 7)] [2018-04-13 00:06:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 439083 backedges. 8833 proven. 387 refuted. 0 times theorem prover too weak. 429863 trivial. 0 not checked. [2018-04-13 00:06:40,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:06:40,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:06:40,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:06:40,663 INFO L87 Difference]: Start difference. First operand 891 states and 1399 transitions. Second operand 13 states. [2018-04-13 00:06:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:40,841 INFO L93 Difference]: Finished difference Result 3286 states and 5229 transitions. [2018-04-13 00:06:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 00:06:40,841 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4783 [2018-04-13 00:06:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:40,855 INFO L225 Difference]: With dead ends: 3286 [2018-04-13 00:06:40,855 INFO L226 Difference]: Without dead ends: 3286 [2018-04-13 00:06:40,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-04-13 00:06:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2018-04-13 00:06:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 891. [2018-04-13 00:06:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-13 00:06:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1399 transitions. [2018-04-13 00:06:40,887 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1399 transitions. Word has length 4783 [2018-04-13 00:06:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:40,888 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1399 transitions. [2018-04-13 00:06:40,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:06:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1399 transitions. [2018-04-13 00:06:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4790 [2018-04-13 00:06:40,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:40,968 INFO L355 BasicCegarLoop]: trace histogram [310, 303, 210, 210, 210, 210, 210, 203, 203, 203, 203, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:40,968 INFO L408 AbstractCegarLoop]: === Iteration 138 === [__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-13 00:06:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1807129843, now seen corresponding path program 115 times [2018-04-13 00:06:40,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:41,506 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 440537 backedges. 9703 proven. 289 refuted. 0 times theorem prover too weak. 430545 trivial. 0 not checked. [2018-04-13 00:06:47,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:47,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:06:47,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 185559 backedges. 1579 proven. 34 refuted. 0 times theorem prover too weak. 183946 trivial. 0 not checked. [2018-04-13 00:06:47,710 INFO L182 omatonBuilderFactory]: Interpolants [164706#(<= main_~i~2 7), 164704#(<= main_~i~2 5), 164705#(<= main_~i~2 6), 164694#true, 164695#false, 164698#(<= (+ |__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)), 164699#(<= (+ |__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 2)), 164696#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 164697#(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)), 164702#(<= (+ |__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 5)), 164703#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 164700#(<= (+ |__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 3)), 164701#(<= (+ |__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 4))] [2018-04-13 00:06:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 440537 backedges. 9703 proven. 289 refuted. 0 times theorem prover too weak. 430545 trivial. 0 not checked. [2018-04-13 00:06:47,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:06:47,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:06:47,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:06:47,715 INFO L87 Difference]: Start difference. First operand 891 states and 1399 transitions. Second operand 13 states. [2018-04-13 00:06:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:47,883 INFO L93 Difference]: Finished difference Result 2644 states and 4408 transitions. [2018-04-13 00:06:47,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 00:06:47,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4789 [2018-04-13 00:06:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:47,895 INFO L225 Difference]: With dead ends: 2644 [2018-04-13 00:06:47,895 INFO L226 Difference]: Without dead ends: 2644 [2018-04-13 00:06:47,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-04-13 00:06:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-04-13 00:06:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 899. [2018-04-13 00:06:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-04-13 00:06:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1505 transitions. [2018-04-13 00:06:47,925 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1505 transitions. Word has length 4789 [2018-04-13 00:06:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:47,927 INFO L459 AbstractCegarLoop]: Abstraction has 899 states and 1505 transitions. [2018-04-13 00:06:47,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:06:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1505 transitions. [2018-04-13 00:06:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4796 [2018-04-13 00:06:48,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:48,009 INFO L355 BasicCegarLoop]: trace histogram [311, 303, 211, 211, 211, 211, 211, 203, 203, 203, 203, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:48,009 INFO L408 AbstractCegarLoop]: === Iteration 139 === [__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-13 00:06:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1168035107, now seen corresponding path program 116 times [2018-04-13 00:06:48,010 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:48,600 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:06:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 441997 backedges. 15503 proven. 357 refuted. 0 times theorem prover too weak. 426137 trivial. 0 not checked. [2018-04-13 00:06:55,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:06:55,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 00:06:55,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:06:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 185559 backedges. 2748 proven. 58 refuted. 0 times theorem prover too weak. 182753 trivial. 0 not checked. [2018-04-13 00:06:55,141 INFO L182 omatonBuilderFactory]: Interpolants [168274#true, 168275#false, 168278#(<= (+ |__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)), 168279#(<= (+ |__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 2)), 168276#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 168277#(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)), 168282#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 168283#(<= main_~i~2 3), 168280#(<= (+ |__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 3)), 168281#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 3), 168284#(<= main_~i~2 4), 168285#(<= main_~i~2 5)] [2018-04-13 00:06:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 441997 backedges. 15503 proven. 357 refuted. 0 times theorem prover too weak. 426137 trivial. 0 not checked. [2018-04-13 00:06:55,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 00:06:55,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 00:06:55,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-13 00:06:55,146 INFO L87 Difference]: Start difference. First operand 899 states and 1505 transitions. Second operand 12 states. [2018-04-13 00:06:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:06:55,278 INFO L93 Difference]: Finished difference Result 2675 states and 5603 transitions. [2018-04-13 00:06:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 00:06:55,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 4795 [2018-04-13 00:06:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:06:55,289 INFO L225 Difference]: With dead ends: 2675 [2018-04-13 00:06:55,289 INFO L226 Difference]: Without dead ends: 2675 [2018-04-13 00:06:55,289 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-13 00:06:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2018-04-13 00:06:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 891. [2018-04-13 00:06:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-13 00:06:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1399 transitions. [2018-04-13 00:06:55,327 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1399 transitions. Word has length 4795 [2018-04-13 00:06:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:06:55,328 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1399 transitions. [2018-04-13 00:06:55,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 00:06:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1399 transitions. [2018-04-13 00:06:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4801 [2018-04-13 00:06:55,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:06:55,407 INFO L355 BasicCegarLoop]: trace histogram [311, 304, 211, 211, 211, 211, 211, 204, 204, 204, 204, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:06:55,407 INFO L408 AbstractCegarLoop]: === Iteration 140 === [__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-13 00:06:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1293917004, now seen corresponding path program 117 times [2018-04-13 00:06:55,408 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:06:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:06:55,886 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 443212 backedges. 10661 proven. 102 refuted. 0 times theorem prover too weak. 432449 trivial. 0 not checked. [2018-04-13 00:07:02,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:02,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:07:02,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 185564 backedges. 1619 proven. 0 refuted. 0 times theorem prover too weak. 183945 trivial. 0 not checked. [2018-04-13 00:07:02,261 INFO L182 omatonBuilderFactory]: Interpolants [171874#(<= main_~i~2 7), 171872#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 171873#(<= main_~i~2 6), 171862#true, 171863#false, 171866#(<= (+ |__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)), 171867#(<= (+ |__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 2)), 171864#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 171865#(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)), 171870#(<= (+ |__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 5)), 171871#(<= (+ |__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 6)), 171868#(<= (+ |__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 3)), 171869#(<= (+ |__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 4))] [2018-04-13 00:07:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 443212 backedges. 10661 proven. 102 refuted. 0 times theorem prover too weak. 432449 trivial. 0 not checked. [2018-04-13 00:07:02,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:07:02,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:07:02,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:07:02,267 INFO L87 Difference]: Start difference. First operand 891 states and 1399 transitions. Second operand 13 states. [2018-04-13 00:07:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:02,505 INFO L93 Difference]: Finished difference Result 1999 states and 3580 transitions. [2018-04-13 00:07:02,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 00:07:02,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4800 [2018-04-13 00:07:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:02,514 INFO L225 Difference]: With dead ends: 1999 [2018-04-13 00:07:02,514 INFO L226 Difference]: Without dead ends: 1999 [2018-04-13 00:07:02,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2018-04-13 00:07:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2018-04-13 00:07:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 906. [2018-04-13 00:07:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-04-13 00:07:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1515 transitions. [2018-04-13 00:07:02,539 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1515 transitions. Word has length 4800 [2018-04-13 00:07:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:02,540 INFO L459 AbstractCegarLoop]: Abstraction has 906 states and 1515 transitions. [2018-04-13 00:07:02,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:07:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1515 transitions. [2018-04-13 00:07:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4807 [2018-04-13 00:07:02,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:02,624 INFO L355 BasicCegarLoop]: trace histogram [312, 304, 212, 212, 212, 212, 212, 204, 204, 204, 204, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:02,624 INFO L408 AbstractCegarLoop]: === Iteration 141 === [__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-13 00:07:02,624 INFO L82 PathProgramCache]: Analyzing trace with hash 169384778, now seen corresponding path program 118 times [2018-04-13 00:07:02,624 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:03,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 444678 backedges. 17776 proven. 38 refuted. 0 times theorem prover too weak. 426864 trivial. 0 not checked. [2018-04-13 00:07:09,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:09,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 00:07:09,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 185557 backedges. 2804 proven. 0 refuted. 0 times theorem prover too weak. 182753 trivial. 0 not checked. [2018-04-13 00:07:09,411 INFO L182 omatonBuilderFactory]: Interpolants [174818#(<= main_~i~2 4), 174819#(<= main_~i~2 5), 174816#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 4), 174817#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 174810#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 174811#(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)), 174808#true, 174809#false, 174814#(<= (+ |__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 3)), 174815#(<= (+ |__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 4)), 174812#(<= (+ |__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)), 174813#(<= (+ |__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 2))] [2018-04-13 00:07:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 444678 backedges. 17776 proven. 38 refuted. 0 times theorem prover too weak. 426864 trivial. 0 not checked. [2018-04-13 00:07:09,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 00:07:09,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 00:07:09,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-13 00:07:09,415 INFO L87 Difference]: Start difference. First operand 906 states and 1515 transitions. Second operand 12 states. [2018-04-13 00:07:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:09,516 INFO L93 Difference]: Finished difference Result 2038 states and 4405 transitions. [2018-04-13 00:07:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 00:07:09,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 4806 [2018-04-13 00:07:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:09,524 INFO L225 Difference]: With dead ends: 2038 [2018-04-13 00:07:09,525 INFO L226 Difference]: Without dead ends: 2038 [2018-04-13 00:07:09,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-04-13 00:07:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2018-04-13 00:07:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 914. [2018-04-13 00:07:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-13 00:07:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1529 transitions. [2018-04-13 00:07:09,550 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1529 transitions. Word has length 4806 [2018-04-13 00:07:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:09,551 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1529 transitions. [2018-04-13 00:07:09,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 00:07:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1529 transitions. [2018-04-13 00:07:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4812 [2018-04-13 00:07:09,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:09,627 INFO L355 BasicCegarLoop]: trace histogram [312, 305, 212, 212, 212, 212, 212, 205, 205, 205, 205, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:09,628 INFO L408 AbstractCegarLoop]: === Iteration 142 === [__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-13 00:07:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -122376753, now seen corresponding path program 119 times [2018-04-13 00:07:09,628 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:10,107 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 445898 backedges. 7869 proven. 535 refuted. 0 times theorem prover too weak. 437494 trivial. 0 not checked. [2018-04-13 00:07:16,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:16,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:07:16,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 185554 backedges. 2116 proven. 80 refuted. 0 times theorem prover too weak. 183358 trivial. 0 not checked. [2018-04-13 00:07:16,527 INFO L182 omatonBuilderFactory]: Interpolants [177794#(<= main_~i~2 5), 177795#(<= main_~i~2 6), 177792#(<= main_~i~2 3), 177793#(<= main_~i~2 4), 177796#(<= main_~i~2 7), 177797#(<= main_~i~2 8), 177786#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 177787#(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)), 177784#true, 177785#false, 177790#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 177791#(<= main_~i~2 2), 177788#(<= (+ |__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)), 177789#(<= (+ |__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 2))] [2018-04-13 00:07:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 445898 backedges. 7869 proven. 535 refuted. 0 times theorem prover too weak. 437494 trivial. 0 not checked. [2018-04-13 00:07:16,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:07:16,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:07:16,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:07:16,532 INFO L87 Difference]: Start difference. First operand 914 states and 1529 transitions. Second operand 14 states. [2018-04-13 00:07:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:16,699 INFO L93 Difference]: Finished difference Result 5187 states and 9144 transitions. [2018-04-13 00:07:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 00:07:16,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4811 [2018-04-13 00:07:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:16,722 INFO L225 Difference]: With dead ends: 5187 [2018-04-13 00:07:16,722 INFO L226 Difference]: Without dead ends: 5187 [2018-04-13 00:07:16,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-04-13 00:07:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2018-04-13 00:07:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 914. [2018-04-13 00:07:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-13 00:07:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1529 transitions. [2018-04-13 00:07:16,779 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1529 transitions. Word has length 4811 [2018-04-13 00:07:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:16,780 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1529 transitions. [2018-04-13 00:07:16,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:07:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1529 transitions. [2018-04-13 00:07:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4823 [2018-04-13 00:07:16,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:16,863 INFO L355 BasicCegarLoop]: trace histogram [313, 306, 213, 213, 213, 213, 213, 206, 206, 206, 206, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:16,863 INFO L408 AbstractCegarLoop]: === Iteration 143 === [__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-13 00:07:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash -211309658, now seen corresponding path program 120 times [2018-04-13 00:07:16,864 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:17,422 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 448595 backedges. 8617 proven. 598 refuted. 0 times theorem prover too weak. 439380 trivial. 0 not checked. [2018-04-13 00:07:23,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:23,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:07:23,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 184705 backedges. 1501 proven. 88 refuted. 0 times theorem prover too weak. 183116 trivial. 0 not checked. [2018-04-13 00:07:23,677 INFO L182 omatonBuilderFactory]: Interpolants [183911#true, 183914#(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)), 183915#(<= (+ |__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)), 183912#false, 183913#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 183918#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 183919#(<= main_~i~2 3), 183916#(<= (+ |__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 2)), 183917#(<= (+ |__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 3)), 183922#(<= main_~i~2 6), 183923#(<= main_~i~2 7), 183920#(<= main_~i~2 4), 183921#(<= main_~i~2 5), 183924#(<= main_~i~2 8)] [2018-04-13 00:07:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 448595 backedges. 8617 proven. 598 refuted. 0 times theorem prover too weak. 439380 trivial. 0 not checked. [2018-04-13 00:07:23,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:07:23,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:07:23,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:07:23,682 INFO L87 Difference]: Start difference. First operand 914 states and 1529 transitions. Second operand 14 states. [2018-04-13 00:07:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:23,861 INFO L93 Difference]: Finished difference Result 4575 states and 8004 transitions. [2018-04-13 00:07:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 00:07:23,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4822 [2018-04-13 00:07:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:23,878 INFO L225 Difference]: With dead ends: 4575 [2018-04-13 00:07:23,878 INFO L226 Difference]: Without dead ends: 4575 [2018-04-13 00:07:23,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-04-13 00:07:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2018-04-13 00:07:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 914. [2018-04-13 00:07:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-13 00:07:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1529 transitions. [2018-04-13 00:07:23,929 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1529 transitions. Word has length 4822 [2018-04-13 00:07:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:23,930 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1529 transitions. [2018-04-13 00:07:23,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:07:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1529 transitions. [2018-04-13 00:07:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4829 [2018-04-13 00:07:24,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:24,011 INFO L355 BasicCegarLoop]: trace histogram [314, 306, 214, 214, 214, 214, 214, 206, 206, 206, 206, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:24,011 INFO L408 AbstractCegarLoop]: === Iteration 144 === [__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-13 00:07:24,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1420881220, now seen corresponding path program 121 times [2018-04-13 00:07:24,012 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:24,536 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 450073 backedges. 9417 proven. 608 refuted. 0 times theorem prover too weak. 440048 trivial. 0 not checked. [2018-04-13 00:07:30,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:30,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:07:30,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 184729 backedges. 1529 proven. 84 refuted. 0 times theorem prover too weak. 183116 trivial. 0 not checked. [2018-04-13 00:07:30,941 INFO L182 omatonBuilderFactory]: Interpolants [189442#(<= main_~i~2 7), 189443#(<= main_~i~2 8), 189440#(<= main_~i~2 5), 189441#(<= main_~i~2 6), 189430#true, 189431#false, 189434#(<= (+ |__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)), 189435#(<= (+ |__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 2)), 189432#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 189433#(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)), 189438#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 189439#(<= main_~i~2 4), 189436#(<= (+ |__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 3)), 189437#(<= (+ |__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 4))] [2018-04-13 00:07:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 450073 backedges. 9417 proven. 608 refuted. 0 times theorem prover too weak. 440048 trivial. 0 not checked. [2018-04-13 00:07:30,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:07:30,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:07:30,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:07:30,946 INFO L87 Difference]: Start difference. First operand 914 states and 1529 transitions. Second operand 14 states. [2018-04-13 00:07:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:31,186 INFO L93 Difference]: Finished difference Result 3949 states and 6838 transitions. [2018-04-13 00:07:31,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 00:07:31,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4828 [2018-04-13 00:07:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:31,209 INFO L225 Difference]: With dead ends: 3949 [2018-04-13 00:07:31,209 INFO L226 Difference]: Without dead ends: 3949 [2018-04-13 00:07:31,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-04-13 00:07:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2018-04-13 00:07:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 914. [2018-04-13 00:07:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-13 00:07:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1529 transitions. [2018-04-13 00:07:31,262 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1529 transitions. Word has length 4828 [2018-04-13 00:07:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:31,263 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1529 transitions. [2018-04-13 00:07:31,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:07:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1529 transitions. [2018-04-13 00:07:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4835 [2018-04-13 00:07:31,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:31,345 INFO L355 BasicCegarLoop]: trace histogram [315, 306, 215, 215, 215, 215, 215, 206, 206, 206, 206, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:31,345 INFO L408 AbstractCegarLoop]: === Iteration 145 === [__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-13 00:07:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2000275218, now seen corresponding path program 122 times [2018-04-13 00:07:31,345 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:31,909 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 451557 backedges. 10287 proven. 547 refuted. 0 times theorem prover too weak. 440723 trivial. 0 not checked. [2018-04-13 00:07:38,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:38,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:07:38,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 184747 backedges. 1563 proven. 68 refuted. 0 times theorem prover too weak. 183116 trivial. 0 not checked. [2018-04-13 00:07:38,272 INFO L182 omatonBuilderFactory]: Interpolants [194338#(<= main_~i~2 6), 194339#(<= main_~i~2 7), 194336#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 194337#(<= main_~i~2 5), 194340#(<= main_~i~2 8), 194327#true, 194330#(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)), 194331#(<= (+ |__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)), 194328#false, 194329#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 194334#(<= (+ |__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 4)), 194335#(<= (+ |__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 5)), 194332#(<= (+ |__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 2)), 194333#(<= (+ |__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 3))] [2018-04-13 00:07:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 451557 backedges. 10287 proven. 547 refuted. 0 times theorem prover too weak. 440723 trivial. 0 not checked. [2018-04-13 00:07:38,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:07:38,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:07:38,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:07:38,277 INFO L87 Difference]: Start difference. First operand 914 states and 1529 transitions. Second operand 14 states. [2018-04-13 00:07:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:38,485 INFO L93 Difference]: Finished difference Result 3317 states and 6039 transitions. [2018-04-13 00:07:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 00:07:38,485 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4834 [2018-04-13 00:07:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:38,499 INFO L225 Difference]: With dead ends: 3317 [2018-04-13 00:07:38,499 INFO L226 Difference]: Without dead ends: 3317 [2018-04-13 00:07:38,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-04-13 00:07:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2018-04-13 00:07:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 922. [2018-04-13 00:07:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2018-04-13 00:07:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1635 transitions. [2018-04-13 00:07:38,540 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1635 transitions. Word has length 4834 [2018-04-13 00:07:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:38,541 INFO L459 AbstractCegarLoop]: Abstraction has 922 states and 1635 transitions. [2018-04-13 00:07:38,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:07:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1635 transitions. [2018-04-13 00:07:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4841 [2018-04-13 00:07:38,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:38,627 INFO L355 BasicCegarLoop]: trace histogram [316, 306, 216, 216, 216, 216, 216, 206, 206, 206, 206, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:38,627 INFO L408 AbstractCegarLoop]: === Iteration 146 === [__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-13 00:07:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1193879384, now seen corresponding path program 123 times [2018-04-13 00:07:38,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:39,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 453047 backedges. 16028 proven. 755 refuted. 0 times theorem prover too weak. 436264 trivial. 0 not checked. [2018-04-13 00:07:45,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:45,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:07:45,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 184753 backedges. 2720 proven. 115 refuted. 0 times theorem prover too weak. 181918 trivial. 0 not checked. [2018-04-13 00:07:45,722 INFO L182 omatonBuilderFactory]: Interpolants [198607#(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)), 198606#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 198605#false, 198604#true, 198611#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 3), 198610#(<= (+ |__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 3)), 198609#(<= (+ |__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 2)), 198608#(<= (+ |__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)), 198615#(<= main_~i~2 5), 198614#(<= main_~i~2 4), 198613#(<= main_~i~2 3), 198612#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 198616#(<= main_~i~2 6)] [2018-04-13 00:07:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 453047 backedges. 16028 proven. 755 refuted. 0 times theorem prover too weak. 436264 trivial. 0 not checked. [2018-04-13 00:07:45,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:07:45,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:07:45,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:07:45,727 INFO L87 Difference]: Start difference. First operand 922 states and 1635 transitions. Second operand 13 states. [2018-04-13 00:07:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:45,856 INFO L93 Difference]: Finished difference Result 3349 states and 7611 transitions. [2018-04-13 00:07:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 00:07:45,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4840 [2018-04-13 00:07:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:45,874 INFO L225 Difference]: With dead ends: 3349 [2018-04-13 00:07:45,874 INFO L226 Difference]: Without dead ends: 3349 [2018-04-13 00:07:45,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-04-13 00:07:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2018-04-13 00:07:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 914. [2018-04-13 00:07:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-13 00:07:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1529 transitions. [2018-04-13 00:07:45,924 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1529 transitions. Word has length 4840 [2018-04-13 00:07:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:45,926 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1529 transitions. [2018-04-13 00:07:45,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:07:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1529 transitions. [2018-04-13 00:07:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4846 [2018-04-13 00:07:46,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:46,008 INFO L355 BasicCegarLoop]: trace histogram [316, 307, 216, 216, 216, 216, 216, 207, 207, 207, 207, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:46,008 INFO L408 AbstractCegarLoop]: === Iteration 147 === [__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-13 00:07:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1894234181, now seen corresponding path program 124 times [2018-04-13 00:07:46,008 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:46,547 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:07:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 454277 backedges. 11245 proven. 397 refuted. 0 times theorem prover too weak. 442635 trivial. 0 not checked. [2018-04-13 00:07:52,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:07:52,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:07:52,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:07:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 184763 backedges. 1603 proven. 40 refuted. 0 times theorem prover too weak. 183120 trivial. 0 not checked. [2018-04-13 00:07:52,861 INFO L182 omatonBuilderFactory]: Interpolants [202891#false, 202890#true, 202895#(<= (+ |__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 2)), 202894#(<= (+ |__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)), 202893#(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)), 202892#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 202899#(<= (+ |__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 6)), 202898#(<= (+ |__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 5)), 202897#(<= (+ |__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 4)), 202896#(<= (+ |__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 3)), 202903#(<= main_~i~2 8), 202902#(<= main_~i~2 7), 202901#(<= main_~i~2 6), 202900#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6)] [2018-04-13 00:07:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 454277 backedges. 11245 proven. 397 refuted. 0 times theorem prover too weak. 442635 trivial. 0 not checked. [2018-04-13 00:07:52,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:07:52,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:07:52,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:07:52,866 INFO L87 Difference]: Start difference. First operand 914 states and 1529 transitions. Second operand 14 states. [2018-04-13 00:07:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:07:53,085 INFO L93 Difference]: Finished difference Result 2683 states and 5329 transitions. [2018-04-13 00:07:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 00:07:53,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4845 [2018-04-13 00:07:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:07:53,098 INFO L225 Difference]: With dead ends: 2683 [2018-04-13 00:07:53,099 INFO L226 Difference]: Without dead ends: 2683 [2018-04-13 00:07:53,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2018-04-13 00:07:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-04-13 00:07:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 922. [2018-04-13 00:07:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2018-04-13 00:07:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1635 transitions. [2018-04-13 00:07:53,139 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1635 transitions. Word has length 4845 [2018-04-13 00:07:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:07:53,141 INFO L459 AbstractCegarLoop]: Abstraction has 922 states and 1635 transitions. [2018-04-13 00:07:53,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:07:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1635 transitions. [2018-04-13 00:07:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4857 [2018-04-13 00:07:53,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:07:53,222 INFO L355 BasicCegarLoop]: trace histogram [317, 308, 217, 217, 217, 217, 217, 208, 208, 208, 208, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:07:53,222 INFO L408 AbstractCegarLoop]: === Iteration 148 === [__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-13 00:07:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash -51188908, now seen corresponding path program 125 times [2018-04-13 00:07:53,222 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:07:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:07:53,761 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 457008 backedges. 12309 proven. 140 refuted. 0 times theorem prover too weak. 444559 trivial. 0 not checked. [2018-04-13 00:08:00,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:00,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:08:00,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 184774 backedges. 1649 proven. 0 refuted. 0 times theorem prover too weak. 183125 trivial. 0 not checked. [2018-04-13 00:08:00,183 INFO L182 omatonBuilderFactory]: Interpolants [206539#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 206538#false, 206537#true, 206543#(<= (+ |__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 3)), 206542#(<= (+ |__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 2)), 206541#(<= (+ |__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)), 206540#(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)), 206547#(<= (+ |__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 7)), 206546#(<= (+ |__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 6)), 206545#(<= (+ |__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 5)), 206544#(<= (+ |__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 4)), 206550#(<= main_~i~2 8), 206549#(<= main_~i~2 7), 206548#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7)] [2018-04-13 00:08:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 457008 backedges. 12309 proven. 140 refuted. 0 times theorem prover too weak. 444559 trivial. 0 not checked. [2018-04-13 00:08:00,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:08:00,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:08:00,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:08:00,188 INFO L87 Difference]: Start difference. First operand 922 states and 1635 transitions. Second operand 14 states. [2018-04-13 00:08:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:00,387 INFO L93 Difference]: Finished difference Result 2046 states and 4417 transitions. [2018-04-13 00:08:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 00:08:00,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4856 [2018-04-13 00:08:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:00,398 INFO L225 Difference]: With dead ends: 2046 [2018-04-13 00:08:00,399 INFO L226 Difference]: Without dead ends: 2046 [2018-04-13 00:08:00,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2018-04-13 00:08:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2018-04-13 00:08:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 929. [2018-04-13 00:08:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-04-13 00:08:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1646 transitions. [2018-04-13 00:08:00,438 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1646 transitions. Word has length 4856 [2018-04-13 00:08:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:00,439 INFO L459 AbstractCegarLoop]: Abstraction has 929 states and 1646 transitions. [2018-04-13 00:08:00,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:08:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1646 transitions. [2018-04-13 00:08:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4858 [2018-04-13 00:08:00,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:00,528 INFO L355 BasicCegarLoop]: trace histogram [318, 307, 218, 218, 218, 218, 218, 207, 207, 207, 207, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:00,528 INFO L408 AbstractCegarLoop]: === Iteration 149 === [__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-13 00:08:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash -316754939, now seen corresponding path program 126 times [2018-04-13 00:08:00,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:01,136 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 457275 backedges. 18289 proven. 544 refuted. 0 times theorem prover too weak. 438442 trivial. 0 not checked. [2018-04-13 00:08:07,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:07,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:08:07,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 184762 backedges. 2776 proven. 68 refuted. 0 times theorem prover too weak. 181918 trivial. 0 not checked. [2018-04-13 00:08:07,713 INFO L182 omatonBuilderFactory]: Interpolants [209570#(<= main_~i~2 6), 209569#(<= main_~i~2 5), 209568#(<= main_~i~2 4), 209559#false, 209558#true, 209563#(<= (+ |__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 2)), 209562#(<= (+ |__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)), 209561#(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)), 209560#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 209567#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 209566#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 4), 209565#(<= (+ |__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 4)), 209564#(<= (+ |__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 3))] [2018-04-13 00:08:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 457275 backedges. 18289 proven. 544 refuted. 0 times theorem prover too weak. 438442 trivial. 0 not checked. [2018-04-13 00:08:07,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:08:07,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:08:07,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:08:07,718 INFO L87 Difference]: Start difference. First operand 929 states and 1646 transitions. Second operand 13 states. [2018-04-13 00:08:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:07,824 INFO L93 Difference]: Finished difference Result 2721 states and 6535 transitions. [2018-04-13 00:08:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 00:08:07,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4857 [2018-04-13 00:08:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:07,838 INFO L225 Difference]: With dead ends: 2721 [2018-04-13 00:08:07,839 INFO L226 Difference]: Without dead ends: 2721 [2018-04-13 00:08:07,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-04-13 00:08:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2018-04-13 00:08:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 929. [2018-04-13 00:08:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-04-13 00:08:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1646 transitions. [2018-04-13 00:08:07,883 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1646 transitions. Word has length 4857 [2018-04-13 00:08:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:07,884 INFO L459 AbstractCegarLoop]: Abstraction has 929 states and 1646 transitions. [2018-04-13 00:08:07,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:08:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1646 transitions. [2018-04-13 00:08:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4863 [2018-04-13 00:08:07,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:07,981 INFO L355 BasicCegarLoop]: trace histogram [318, 308, 218, 218, 218, 218, 218, 208, 208, 208, 208, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:07,981 INFO L408 AbstractCegarLoop]: === Iteration 150 === [__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-13 00:08:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash 518972222, now seen corresponding path program 127 times [2018-04-13 00:08:07,982 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:08,520 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 458510 backedges. 20733 proven. 60 refuted. 0 times theorem prover too weak. 437717 trivial. 0 not checked. [2018-04-13 00:08:14,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:14,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 00:08:14,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 184767 backedges. 2849 proven. 0 refuted. 0 times theorem prover too weak. 181918 trivial. 0 not checked. [2018-04-13 00:08:14,956 INFO L182 omatonBuilderFactory]: Interpolants [213235#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 213234#false, 213233#true, 213239#(<= (+ |__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 3)), 213238#(<= (+ |__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 2)), 213237#(<= (+ |__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)), 213236#(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)), 213243#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 213242#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 5), 213241#(<= (+ |__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 5)), 213240#(<= (+ |__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 4)), 213245#(<= main_~i~2 6), 213244#(<= main_~i~2 5)] [2018-04-13 00:08:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 458510 backedges. 20733 proven. 60 refuted. 0 times theorem prover too weak. 437717 trivial. 0 not checked. [2018-04-13 00:08:14,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 00:08:14,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 00:08:14,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-04-13 00:08:14,965 INFO L87 Difference]: Start difference. First operand 929 states and 1646 transitions. Second operand 13 states. [2018-04-13 00:08:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:15,076 INFO L93 Difference]: Finished difference Result 2069 states and 4837 transitions. [2018-04-13 00:08:15,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 00:08:15,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 4862 [2018-04-13 00:08:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:15,086 INFO L225 Difference]: With dead ends: 2069 [2018-04-13 00:08:15,086 INFO L226 Difference]: Without dead ends: 2069 [2018-04-13 00:08:15,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-04-13 00:08:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-04-13 00:08:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 937. [2018-04-13 00:08:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 00:08:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1661 transitions. [2018-04-13 00:08:15,118 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1661 transitions. Word has length 4862 [2018-04-13 00:08:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:15,119 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 1661 transitions. [2018-04-13 00:08:15,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 00:08:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1661 transitions. [2018-04-13 00:08:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4868 [2018-04-13 00:08:15,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:15,204 INFO L355 BasicCegarLoop]: trace histogram [318, 309, 218, 218, 218, 218, 218, 209, 209, 209, 209, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:15,204 INFO L408 AbstractCegarLoop]: === Iteration 151 === [__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-13 00:08:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1108426331, now seen corresponding path program 128 times [2018-04-13 00:08:15,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:15,749 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 459750 backedges. 8439 proven. 703 refuted. 0 times theorem prover too weak. 450608 trivial. 0 not checked. [2018-04-13 00:08:22,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:22,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:08:22,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 184764 backedges. 2093 proven. 96 refuted. 0 times theorem prover too weak. 182575 trivial. 0 not checked. [2018-04-13 00:08:22,159 INFO L182 omatonBuilderFactory]: Interpolants [216267#false, 216266#true, 216271#(<= (+ |__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 2)), 216270#(<= (+ |__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)), 216269#(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)), 216268#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 216275#(<= main_~i~2 4), 216274#(<= main_~i~2 3), 216273#(<= main_~i~2 2), 216272#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 216279#(<= main_~i~2 8), 216278#(<= main_~i~2 7), 216277#(<= main_~i~2 6), 216276#(<= main_~i~2 5), 216280#(<= main_~i~2 9)] [2018-04-13 00:08:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 459750 backedges. 8439 proven. 703 refuted. 0 times theorem prover too weak. 450608 trivial. 0 not checked. [2018-04-13 00:08:22,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:08:22,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:08:22,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:08:22,163 INFO L87 Difference]: Start difference. First operand 937 states and 1661 transitions. Second operand 15 states. [2018-04-13 00:08:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:22,328 INFO L93 Difference]: Finished difference Result 5808 states and 11033 transitions. [2018-04-13 00:08:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 00:08:22,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4867 [2018-04-13 00:08:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:22,355 INFO L225 Difference]: With dead ends: 5808 [2018-04-13 00:08:22,355 INFO L226 Difference]: Without dead ends: 5808 [2018-04-13 00:08:22,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-04-13 00:08:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2018-04-13 00:08:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 937. [2018-04-13 00:08:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 00:08:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1661 transitions. [2018-04-13 00:08:22,428 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1661 transitions. Word has length 4867 [2018-04-13 00:08:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:22,429 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 1661 transitions. [2018-04-13 00:08:22,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:08:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1661 transitions. [2018-04-13 00:08:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4879 [2018-04-13 00:08:22,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:22,513 INFO L355 BasicCegarLoop]: trace histogram [319, 310, 219, 219, 219, 219, 219, 210, 210, 210, 210, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:22,513 INFO L408 AbstractCegarLoop]: === Iteration 152 === [__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-13 00:08:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1477000728, now seen corresponding path program 129 times [2018-04-13 00:08:22,514 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:23,034 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 462503 backedges. 9187 proven. 809 refuted. 0 times theorem prover too weak. 452507 trivial. 0 not checked. [2018-04-13 00:08:29,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:29,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:08:29,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 183936 backedges. 1485 proven. 110 refuted. 0 times theorem prover too weak. 182341 trivial. 0 not checked. [2018-04-13 00:08:29,492 INFO L182 omatonBuilderFactory]: Interpolants [223043#(<= (+ |__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 2)), 223042#(<= (+ |__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)), 223041#(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)), 223040#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 223047#(<= main_~i~2 4), 223046#(<= main_~i~2 3), 223045#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 223044#(<= (+ |__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 3)), 223051#(<= main_~i~2 8), 223050#(<= main_~i~2 7), 223049#(<= main_~i~2 6), 223048#(<= main_~i~2 5), 223052#(<= main_~i~2 9), 223039#false, 223038#true] [2018-04-13 00:08:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 462503 backedges. 9187 proven. 809 refuted. 0 times theorem prover too weak. 452507 trivial. 0 not checked. [2018-04-13 00:08:29,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:08:29,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:08:29,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:08:29,497 INFO L87 Difference]: Start difference. First operand 937 states and 1661 transitions. Second operand 15 states. [2018-04-13 00:08:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:29,702 INFO L93 Difference]: Finished difference Result 5210 states and 9833 transitions. [2018-04-13 00:08:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 00:08:29,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4878 [2018-04-13 00:08:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:29,726 INFO L225 Difference]: With dead ends: 5210 [2018-04-13 00:08:29,726 INFO L226 Difference]: Without dead ends: 5210 [2018-04-13 00:08:29,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-04-13 00:08:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2018-04-13 00:08:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 937. [2018-04-13 00:08:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 00:08:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1661 transitions. [2018-04-13 00:08:29,794 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1661 transitions. Word has length 4878 [2018-04-13 00:08:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:29,795 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 1661 transitions. [2018-04-13 00:08:29,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:08:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1661 transitions. [2018-04-13 00:08:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4885 [2018-04-13 00:08:29,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:29,880 INFO L355 BasicCegarLoop]: trace histogram [320, 310, 220, 220, 220, 220, 220, 210, 210, 210, 210, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:29,880 INFO L408 AbstractCegarLoop]: === Iteration 153 === [__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-13 00:08:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash -458469694, now seen corresponding path program 130 times [2018-04-13 00:08:29,880 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:30,611 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 464017 backedges. 14712 proven. 1327 refuted. 0 times theorem prover too weak. 447978 trivial. 0 not checked. [2018-04-13 00:08:40,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:40,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:08:40,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 183966 backedges. 2590 proven. 238 refuted. 0 times theorem prover too weak. 181138 trivial. 0 not checked. [2018-04-13 00:08:40,386 INFO L182 omatonBuilderFactory]: Interpolants [229219#(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)), 229218#(= 0 |main_~#b~0.offset|), 229217#false, 229216#true, 229223#(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)) (<= 12 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))))), 229222#(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_~i~1))))), 229221#(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))))), 229220#(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))))), 229227#(<= (+ |__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)), 229226#(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)), 229225#(or (not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)) (<= 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)), 229224#(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)) (<= 16 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size))))), 229231#(not (= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset| 0)), 229230#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 3), 229229#(<= (+ |__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 3)), 229228#(<= (+ |__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 2))] [2018-04-13 00:08:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 464017 backedges. 14712 proven. 1327 refuted. 0 times theorem prover too weak. 447978 trivial. 0 not checked. [2018-04-13 00:08:40,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:08:40,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:08:40,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:08:40,391 INFO L87 Difference]: Start difference. First operand 937 states and 1661 transitions. Second operand 16 states. [2018-04-13 00:08:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:40,592 INFO L93 Difference]: Finished difference Result 953 states and 1677 transitions. [2018-04-13 00:08:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 00:08:40,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4884 [2018-04-13 00:08:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:40,598 INFO L225 Difference]: With dead ends: 953 [2018-04-13 00:08:40,598 INFO L226 Difference]: Without dead ends: 937 [2018-04-13 00:08:40,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-04-13 00:08:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-04-13 00:08:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2018-04-13 00:08:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 00:08:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1656 transitions. [2018-04-13 00:08:40,613 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1656 transitions. Word has length 4884 [2018-04-13 00:08:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:40,614 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 1656 transitions. [2018-04-13 00:08:40,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:08:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1656 transitions. [2018-04-13 00:08:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4900 [2018-04-13 00:08:40,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:40,744 INFO L355 BasicCegarLoop]: trace histogram [320, 313, 220, 220, 220, 220, 220, 213, 213, 213, 213, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:40,744 INFO L408 AbstractCegarLoop]: === Iteration 154 === [__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-13 00:08:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 772299027, now seen corresponding path program 131 times [2018-04-13 00:08:40,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:41,288 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 467782 backedges. 9987 proven. 862 refuted. 0 times theorem prover too weak. 456933 trivial. 0 not checked. [2018-04-13 00:08:48,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:48,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:08:48,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 184026 backedges. 1513 proven. 112 refuted. 0 times theorem prover too weak. 182401 trivial. 0 not checked. [2018-04-13 00:08:48,373 INFO L182 omatonBuilderFactory]: Interpolants [231139#(<= (+ |__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 2)), 231138#(<= (+ |__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)), 231137#(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)), 231136#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 231143#(<= main_~i~2 4), 231142#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 231141#(<= (+ |__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 4)), 231140#(<= (+ |__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 3)), 231147#(<= main_~i~2 8), 231146#(<= main_~i~2 7), 231145#(<= main_~i~2 6), 231144#(<= main_~i~2 5), 231148#(<= main_~i~2 9), 231135#false, 231134#true] [2018-04-13 00:08:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 467782 backedges. 9987 proven. 862 refuted. 0 times theorem prover too weak. 456933 trivial. 0 not checked. [2018-04-13 00:08:48,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:08:48,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:08:48,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:08:48,378 INFO L87 Difference]: Start difference. First operand 937 states and 1656 transitions. Second operand 15 states. [2018-04-13 00:08:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:48,609 INFO L93 Difference]: Finished difference Result 4598 states and 8600 transitions. [2018-04-13 00:08:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 00:08:48,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4899 [2018-04-13 00:08:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:48,630 INFO L225 Difference]: With dead ends: 4598 [2018-04-13 00:08:48,630 INFO L226 Difference]: Without dead ends: 4598 [2018-04-13 00:08:48,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2018-04-13 00:08:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2018-04-13 00:08:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 937. [2018-04-13 00:08:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 00:08:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1656 transitions. [2018-04-13 00:08:48,698 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1656 transitions. Word has length 4899 [2018-04-13 00:08:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:48,699 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 1656 transitions. [2018-04-13 00:08:48,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:08:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1656 transitions. [2018-04-13 00:08:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4906 [2018-04-13 00:08:48,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:48,780 INFO L355 BasicCegarLoop]: trace histogram [321, 313, 221, 221, 221, 221, 221, 213, 213, 213, 213, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:48,780 INFO L408 AbstractCegarLoop]: === Iteration 155 === [__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-13 00:08:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 787127485, now seen corresponding path program 132 times [2018-04-13 00:08:48,781 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:49,561 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:08:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 469302 backedges. 10857 proven. 844 refuted. 0 times theorem prover too weak. 457601 trivial. 0 not checked. [2018-04-13 00:08:56,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:08:56,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:08:56,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:08:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 184050 backedges. 1547 proven. 102 refuted. 0 times theorem prover too weak. 182401 trivial. 0 not checked. [2018-04-13 00:08:56,162 INFO L182 omatonBuilderFactory]: Interpolants [236707#(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)), 236706#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 236705#false, 236704#true, 236711#(<= (+ |__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 4)), 236710#(<= (+ |__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 3)), 236709#(<= (+ |__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 2)), 236708#(<= (+ |__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)), 236715#(<= main_~i~2 6), 236714#(<= main_~i~2 5), 236713#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 236712#(<= (+ |__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 5)), 236718#(<= main_~i~2 9), 236717#(<= main_~i~2 8), 236716#(<= main_~i~2 7)] [2018-04-13 00:08:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 469302 backedges. 10857 proven. 844 refuted. 0 times theorem prover too weak. 457601 trivial. 0 not checked. [2018-04-13 00:08:56,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:08:56,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:08:56,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:08:56,167 INFO L87 Difference]: Start difference. First operand 937 states and 1656 transitions. Second operand 15 states. [2018-04-13 00:08:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:08:56,378 INFO L93 Difference]: Finished difference Result 3972 states and 7344 transitions. [2018-04-13 00:08:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 00:08:56,378 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4905 [2018-04-13 00:08:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:08:56,393 INFO L225 Difference]: With dead ends: 3972 [2018-04-13 00:08:56,393 INFO L226 Difference]: Without dead ends: 3972 [2018-04-13 00:08:56,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-04-13 00:08:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2018-04-13 00:08:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 937. [2018-04-13 00:08:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-04-13 00:08:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1656 transitions. [2018-04-13 00:08:56,436 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1656 transitions. Word has length 4905 [2018-04-13 00:08:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:08:56,437 INFO L459 AbstractCegarLoop]: Abstraction has 937 states and 1656 transitions. [2018-04-13 00:08:56,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:08:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1656 transitions. [2018-04-13 00:08:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4912 [2018-04-13 00:08:56,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:08:56,518 INFO L355 BasicCegarLoop]: trace histogram [322, 313, 222, 222, 222, 222, 222, 213, 213, 213, 213, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:08:56,518 INFO L408 AbstractCegarLoop]: === Iteration 156 === [__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-13 00:08:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1292143021, now seen corresponding path program 133 times [2018-04-13 00:08:56,519 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:08:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:08:57,109 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 470828 backedges. 11815 proven. 737 refuted. 0 times theorem prover too weak. 458276 trivial. 0 not checked. [2018-04-13 00:09:03,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:03,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:09:03,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 184068 backedges. 1587 proven. 80 refuted. 0 times theorem prover too weak. 182401 trivial. 0 not checked. [2018-04-13 00:09:03,979 INFO L182 omatonBuilderFactory]: Interpolants [241666#(<= main_~i~2 9), 241665#(<= main_~i~2 8), 241664#(<= main_~i~2 7), 241655#(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)), 241654#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 241653#false, 241652#true, 241659#(<= (+ |__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 4)), 241658#(<= (+ |__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 3)), 241657#(<= (+ |__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 2)), 241656#(<= (+ |__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)), 241663#(<= main_~i~2 6), 241662#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 241661#(<= (+ |__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 6)), 241660#(<= (+ |__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 5))] [2018-04-13 00:09:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 470828 backedges. 11815 proven. 737 refuted. 0 times theorem prover too weak. 458276 trivial. 0 not checked. [2018-04-13 00:09:03,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:09:03,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:09:03,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:09:03,984 INFO L87 Difference]: Start difference. First operand 937 states and 1656 transitions. Second operand 15 states. [2018-04-13 00:09:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:04,278 INFO L93 Difference]: Finished difference Result 3340 states and 6453 transitions. [2018-04-13 00:09:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 00:09:04,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4911 [2018-04-13 00:09:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:04,304 INFO L225 Difference]: With dead ends: 3340 [2018-04-13 00:09:04,305 INFO L226 Difference]: Without dead ends: 3340 [2018-04-13 00:09:04,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2018-04-13 00:09:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2018-04-13 00:09:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 945. [2018-04-13 00:09:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-04-13 00:09:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1762 transitions. [2018-04-13 00:09:04,352 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1762 transitions. Word has length 4911 [2018-04-13 00:09:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:04,353 INFO L459 AbstractCegarLoop]: Abstraction has 945 states and 1762 transitions. [2018-04-13 00:09:04,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:09:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1762 transitions. [2018-04-13 00:09:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4923 [2018-04-13 00:09:04,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:04,440 INFO L355 BasicCegarLoop]: trace histogram [323, 314, 223, 223, 223, 223, 223, 214, 214, 214, 214, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:04,440 INFO L408 AbstractCegarLoop]: === Iteration 157 === [__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-13 00:09:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 401429180, now seen corresponding path program 134 times [2018-04-13 00:09:04,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:04,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 473625 backedges. 12879 proven. 523 refuted. 0 times theorem prover too weak. 460223 trivial. 0 not checked. [2018-04-13 00:09:11,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:11,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:09:11,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 184084 backedges. 1633 proven. 46 refuted. 0 times theorem prover too weak. 182405 trivial. 0 not checked. [2018-04-13 00:09:11,748 INFO L182 omatonBuilderFactory]: Interpolants [245987#(<= (+ |__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 4)), 245986#(<= (+ |__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 3)), 245985#(<= (+ |__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 2)), 245984#(<= (+ |__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)), 245991#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 245990#(<= (+ |__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 7)), 245989#(<= (+ |__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 6)), 245988#(<= (+ |__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 5)), 245994#(<= main_~i~2 9), 245993#(<= main_~i~2 8), 245992#(<= main_~i~2 7), 245983#(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)), 245982#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 245981#false, 245980#true] [2018-04-13 00:09:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 473625 backedges. 12879 proven. 523 refuted. 0 times theorem prover too weak. 460223 trivial. 0 not checked. [2018-04-13 00:09:11,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:09:11,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:09:11,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:09:11,753 INFO L87 Difference]: Start difference. First operand 945 states and 1762 transitions. Second operand 15 states. [2018-04-13 00:09:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:12,015 INFO L93 Difference]: Finished difference Result 2706 states and 5649 transitions. [2018-04-13 00:09:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 00:09:12,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4922 [2018-04-13 00:09:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:12,027 INFO L225 Difference]: With dead ends: 2706 [2018-04-13 00:09:12,028 INFO L226 Difference]: Without dead ends: 2706 [2018-04-13 00:09:12,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2018-04-13 00:09:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2018-04-13 00:09:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 945. [2018-04-13 00:09:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-04-13 00:09:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1762 transitions. [2018-04-13 00:09:12,065 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1762 transitions. Word has length 4922 [2018-04-13 00:09:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:12,066 INFO L459 AbstractCegarLoop]: Abstraction has 945 states and 1762 transitions. [2018-04-13 00:09:12,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:09:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1762 transitions. [2018-04-13 00:09:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4924 [2018-04-13 00:09:12,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:12,149 INFO L355 BasicCegarLoop]: trace histogram [324, 313, 224, 224, 224, 224, 224, 213, 213, 213, 213, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:12,149 INFO L408 AbstractCegarLoop]: === Iteration 158 === [__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-13 00:09:12,150 INFO L82 PathProgramCache]: Analyzing trace with hash -562920301, now seen corresponding path program 135 times [2018-04-13 00:09:12,150 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:12,929 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 473898 backedges. 18832 proven. 1079 refuted. 0 times theorem prover too weak. 453987 trivial. 0 not checked. [2018-04-13 00:09:19,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:19,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:09:19,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 184080 backedges. 2764 proven. 136 refuted. 0 times theorem prover too weak. 181180 trivial. 0 not checked. [2018-04-13 00:09:19,725 INFO L182 omatonBuilderFactory]: Interpolants [249679#false, 249678#true, 249683#(<= (+ |__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 2)), 249682#(<= (+ |__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)), 249681#(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)), 249680#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 249687#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 249686#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 4), 249685#(<= (+ |__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 4)), 249684#(<= (+ |__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 3)), 249691#(<= main_~i~2 7), 249690#(<= main_~i~2 6), 249689#(<= main_~i~2 5), 249688#(<= main_~i~2 4)] [2018-04-13 00:09:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 473898 backedges. 18832 proven. 1079 refuted. 0 times theorem prover too weak. 453987 trivial. 0 not checked. [2018-04-13 00:09:19,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:09:19,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:09:19,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:09:19,730 INFO L87 Difference]: Start difference. First operand 945 states and 1762 transitions. Second operand 14 states. [2018-04-13 00:09:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:19,887 INFO L93 Difference]: Finished difference Result 3388 states and 8811 transitions. [2018-04-13 00:09:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 00:09:19,887 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4923 [2018-04-13 00:09:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:19,910 INFO L225 Difference]: With dead ends: 3388 [2018-04-13 00:09:19,910 INFO L226 Difference]: Without dead ends: 3388 [2018-04-13 00:09:19,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-04-13 00:09:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-04-13 00:09:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 945. [2018-04-13 00:09:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-04-13 00:09:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1762 transitions. [2018-04-13 00:09:19,977 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1762 transitions. Word has length 4923 [2018-04-13 00:09:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:19,979 INFO L459 AbstractCegarLoop]: Abstraction has 945 states and 1762 transitions. [2018-04-13 00:09:19,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:09:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1762 transitions. [2018-04-13 00:09:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4934 [2018-04-13 00:09:20,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:20,067 INFO L355 BasicCegarLoop]: trace histogram [324, 315, 224, 224, 224, 224, 224, 215, 215, 215, 215, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:20,067 INFO L408 AbstractCegarLoop]: === Iteration 159 === [__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-13 00:09:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash -66048899, now seen corresponding path program 136 times [2018-04-13 00:09:20,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:20,664 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 476433 backedges. 14067 proven. 184 refuted. 0 times theorem prover too weak. 462182 trivial. 0 not checked. [2018-04-13 00:09:27,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:27,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:09:27,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 184095 backedges. 1685 proven. 0 refuted. 0 times theorem prover too weak. 182410 trivial. 0 not checked. [2018-04-13 00:09:27,585 INFO L182 omatonBuilderFactory]: Interpolants [254051#(<= main_~i~2 9), 254050#(<= main_~i~2 8), 254049#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 254048#(<= (+ |__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 8)), 254039#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 254038#false, 254037#true, 254043#(<= (+ |__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 3)), 254042#(<= (+ |__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 2)), 254041#(<= (+ |__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)), 254040#(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)), 254047#(<= (+ |__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 7)), 254046#(<= (+ |__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 6)), 254045#(<= (+ |__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 5)), 254044#(<= (+ |__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 4))] [2018-04-13 00:09:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 476433 backedges. 14067 proven. 184 refuted. 0 times theorem prover too weak. 462182 trivial. 0 not checked. [2018-04-13 00:09:27,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:09:27,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:09:27,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:09:27,590 INFO L87 Difference]: Start difference. First operand 945 states and 1762 transitions. Second operand 15 states. [2018-04-13 00:09:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:27,851 INFO L93 Difference]: Finished difference Result 2069 states and 4641 transitions. [2018-04-13 00:09:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 00:09:27,851 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4933 [2018-04-13 00:09:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:27,863 INFO L225 Difference]: With dead ends: 2069 [2018-04-13 00:09:27,863 INFO L226 Difference]: Without dead ends: 2069 [2018-04-13 00:09:27,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=721, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 00:09:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-04-13 00:09:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 952. [2018-04-13 00:09:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-04-13 00:09:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1773 transitions. [2018-04-13 00:09:27,899 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1773 transitions. Word has length 4933 [2018-04-13 00:09:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:27,900 INFO L459 AbstractCegarLoop]: Abstraction has 952 states and 1773 transitions. [2018-04-13 00:09:27,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:09:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1773 transitions. [2018-04-13 00:09:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4935 [2018-04-13 00:09:27,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:27,986 INFO L355 BasicCegarLoop]: trace histogram [325, 314, 225, 225, 225, 225, 225, 214, 214, 214, 214, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:27,987 INFO L408 AbstractCegarLoop]: === Iteration 160 === [__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-13 00:09:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1175805144, now seen corresponding path program 137 times [2018-04-13 00:09:27,987 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:28,771 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 476707 backedges. 21274 proven. 720 refuted. 0 times theorem prover too weak. 454713 trivial. 0 not checked. [2018-04-13 00:09:35,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:35,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:09:35,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 184083 backedges. 2831 proven. 79 refuted. 0 times theorem prover too weak. 181173 trivial. 0 not checked. [2018-04-13 00:09:35,457 INFO L182 omatonBuilderFactory]: Interpolants [257122#(<= main_~i~2 7), 257121#(<= main_~i~2 6), 257120#(<= main_~i~2 5), 257111#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 257110#false, 257109#true, 257115#(<= (+ |__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 3)), 257114#(<= (+ |__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 2)), 257113#(<= (+ |__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)), 257112#(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)), 257119#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 257118#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 5), 257117#(<= (+ |__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 5)), 257116#(<= (+ |__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 4))] [2018-04-13 00:09:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 476707 backedges. 21274 proven. 720 refuted. 0 times theorem prover too weak. 454713 trivial. 0 not checked. [2018-04-13 00:09:35,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:09:35,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:09:35,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:09:35,462 INFO L87 Difference]: Start difference. First operand 952 states and 1773 transitions. Second operand 14 states. [2018-04-13 00:09:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:35,596 INFO L93 Difference]: Finished difference Result 2752 states and 7154 transitions. [2018-04-13 00:09:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 00:09:35,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4934 [2018-04-13 00:09:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:35,611 INFO L225 Difference]: With dead ends: 2752 [2018-04-13 00:09:35,611 INFO L226 Difference]: Without dead ends: 2752 [2018-04-13 00:09:35,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-04-13 00:09:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2018-04-13 00:09:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 952. [2018-04-13 00:09:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-04-13 00:09:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1773 transitions. [2018-04-13 00:09:35,667 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1773 transitions. Word has length 4934 [2018-04-13 00:09:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:35,669 INFO L459 AbstractCegarLoop]: Abstraction has 952 states and 1773 transitions. [2018-04-13 00:09:35,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:09:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1773 transitions. [2018-04-13 00:09:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4940 [2018-04-13 00:09:35,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:35,754 INFO L355 BasicCegarLoop]: trace histogram [325, 315, 225, 225, 225, 225, 225, 215, 215, 215, 215, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:35,754 INFO L408 AbstractCegarLoop]: === Iteration 161 === [__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-13 00:09:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -380740397, now seen corresponding path program 138 times [2018-04-13 00:09:35,754 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:36,299 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 477977 backedges. 23932 proven. 87 refuted. 0 times theorem prover too weak. 453958 trivial. 0 not checked. [2018-04-13 00:09:43,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:43,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 00:09:43,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 184088 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 181173 trivial. 0 not checked. [2018-04-13 00:09:43,525 INFO L182 omatonBuilderFactory]: Interpolants [260843#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 260842#false, 260841#true, 260847#(<= (+ |__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 3)), 260846#(<= (+ |__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 2)), 260845#(<= (+ |__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)), 260844#(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)), 260851#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 6), 260850#(<= (+ |__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 6)), 260849#(<= (+ |__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 5)), 260848#(<= (+ |__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 4)), 260854#(<= main_~i~2 7), 260853#(<= main_~i~2 6), 260852#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6)] [2018-04-13 00:09:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 477977 backedges. 23932 proven. 87 refuted. 0 times theorem prover too weak. 453958 trivial. 0 not checked. [2018-04-13 00:09:43,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 00:09:43,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 00:09:43,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-13 00:09:43,530 INFO L87 Difference]: Start difference. First operand 952 states and 1773 transitions. Second operand 14 states. [2018-04-13 00:09:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:43,666 INFO L93 Difference]: Finished difference Result 2100 states and 5265 transitions. [2018-04-13 00:09:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 00:09:43,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 4939 [2018-04-13 00:09:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:43,681 INFO L225 Difference]: With dead ends: 2100 [2018-04-13 00:09:43,681 INFO L226 Difference]: Without dead ends: 2100 [2018-04-13 00:09:43,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-04-13 00:09:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-04-13 00:09:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 960. [2018-04-13 00:09:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-04-13 00:09:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1789 transitions. [2018-04-13 00:09:43,716 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1789 transitions. Word has length 4939 [2018-04-13 00:09:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:43,717 INFO L459 AbstractCegarLoop]: Abstraction has 960 states and 1789 transitions. [2018-04-13 00:09:43,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 00:09:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1789 transitions. [2018-04-13 00:09:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4945 [2018-04-13 00:09:43,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:43,801 INFO L355 BasicCegarLoop]: trace histogram [325, 316, 225, 225, 225, 225, 225, 216, 216, 216, 216, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:43,801 INFO L408 AbstractCegarLoop]: === Iteration 162 === [__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-13 00:09:43,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1816692250, now seen corresponding path program 139 times [2018-04-13 00:09:43,801 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:44,483 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 479252 backedges. 8995 proven. 892 refuted. 0 times theorem prover too weak. 469365 trivial. 0 not checked. [2018-04-13 00:09:51,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:51,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:09:51,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 184085 backedges. 2070 proven. 112 refuted. 0 times theorem prover too weak. 181903 trivial. 0 not checked. [2018-04-13 00:09:51,469 INFO L182 omatonBuilderFactory]: Interpolants [263940#(<= main_~i~2 4), 263941#(<= main_~i~2 5), 263942#(<= main_~i~2 6), 263943#(<= main_~i~2 7), 263936#(<= (+ |__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 2)), 263937#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 2), 263938#(<= main_~i~2 2), 263939#(<= main_~i~2 3), 263944#(<= main_~i~2 8), 263945#(<= main_~i~2 9), 263946#(<= main_~i~2 10), 263932#false, 263933#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 263934#(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)), 263935#(<= (+ |__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)), 263931#true] [2018-04-13 00:09:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 479252 backedges. 8995 proven. 892 refuted. 0 times theorem prover too weak. 469365 trivial. 0 not checked. [2018-04-13 00:09:51,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:09:51,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:09:51,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:09:51,474 INFO L87 Difference]: Start difference. First operand 960 states and 1789 transitions. Second operand 16 states. [2018-04-13 00:09:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:51,674 INFO L93 Difference]: Finished difference Result 6415 states and 13060 transitions. [2018-04-13 00:09:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 00:09:51,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4944 [2018-04-13 00:09:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:51,710 INFO L225 Difference]: With dead ends: 6415 [2018-04-13 00:09:51,710 INFO L226 Difference]: Without dead ends: 6415 [2018-04-13 00:09:51,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-04-13 00:09:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6415 states. [2018-04-13 00:09:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6415 to 960. [2018-04-13 00:09:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-04-13 00:09:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1789 transitions. [2018-04-13 00:09:51,811 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1789 transitions. Word has length 4944 [2018-04-13 00:09:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:51,812 INFO L459 AbstractCegarLoop]: Abstraction has 960 states and 1789 transitions. [2018-04-13 00:09:51,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:09:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1789 transitions. [2018-04-13 00:09:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4956 [2018-04-13 00:09:51,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:51,897 INFO L355 BasicCegarLoop]: trace histogram [326, 317, 226, 226, 226, 226, 226, 217, 217, 217, 217, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:51,897 INFO L408 AbstractCegarLoop]: === Iteration 163 === [__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-13 00:09:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 972591919, now seen corresponding path program 140 times [2018-04-13 00:09:51,897 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:09:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:09:52,692 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:09:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 482082 backedges. 9743 proven. 1047 refuted. 0 times theorem prover too weak. 471292 trivial. 0 not checked. [2018-04-13 00:09:59,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:09:59,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:09:59,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:09:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 183272 backedges. 1469 proven. 132 refuted. 0 times theorem prover too weak. 181671 trivial. 0 not checked. [2018-04-13 00:09:59,433 INFO L182 omatonBuilderFactory]: Interpolants [271334#true, 271335#false, 271340#(<= (+ |__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 3)), 271341#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 3), 271342#(<= main_~i~2 3), 271343#(<= main_~i~2 4), 271336#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 271337#(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)), 271338#(<= (+ |__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)), 271339#(<= (+ |__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 2)), 271348#(<= main_~i~2 9), 271349#(<= main_~i~2 10), 271344#(<= main_~i~2 5), 271345#(<= main_~i~2 6), 271346#(<= main_~i~2 7), 271347#(<= main_~i~2 8)] [2018-04-13 00:09:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 482082 backedges. 9743 proven. 1047 refuted. 0 times theorem prover too weak. 471292 trivial. 0 not checked. [2018-04-13 00:09:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:09:59,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:09:59,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:09:59,438 INFO L87 Difference]: Start difference. First operand 960 states and 1789 transitions. Second operand 16 states. [2018-04-13 00:09:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:09:59,648 INFO L93 Difference]: Finished difference Result 5831 states and 11804 transitions. [2018-04-13 00:09:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 00:09:59,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4955 [2018-04-13 00:09:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:09:59,680 INFO L225 Difference]: With dead ends: 5831 [2018-04-13 00:09:59,680 INFO L226 Difference]: Without dead ends: 5831 [2018-04-13 00:09:59,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-04-13 00:09:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2018-04-13 00:09:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 960. [2018-04-13 00:09:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-04-13 00:09:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1789 transitions. [2018-04-13 00:09:59,766 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1789 transitions. Word has length 4955 [2018-04-13 00:09:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:09:59,768 INFO L459 AbstractCegarLoop]: Abstraction has 960 states and 1789 transitions. [2018-04-13 00:09:59,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:09:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1789 transitions. [2018-04-13 00:09:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4967 [2018-04-13 00:09:59,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:09:59,857 INFO L355 BasicCegarLoop]: trace histogram [327, 318, 227, 227, 227, 227, 227, 218, 218, 218, 218, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:09:59,857 INFO L408 AbstractCegarLoop]: === Iteration 164 === [__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-13 00:09:59,857 INFO L82 PathProgramCache]: Analyzing trace with hash -409623156, now seen corresponding path program 141 times [2018-04-13 00:09:59,858 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:00,577 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 484923 backedges. 10543 proven. 1149 refuted. 0 times theorem prover too weak. 473231 trivial. 0 not checked. [2018-04-13 00:10:07,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:07,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:10:07,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 183344 backedges. 1497 proven. 140 refuted. 0 times theorem prover too weak. 181707 trivial. 0 not checked. [2018-04-13 00:10:07,573 INFO L182 omatonBuilderFactory]: Interpolants [278157#true, 278158#false, 278159#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 278164#(<= (+ |__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 4)), 278165#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 278166#(<= main_~i~2 4), 278167#(<= main_~i~2 5), 278160#(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)), 278161#(<= (+ |__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)), 278162#(<= (+ |__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 2)), 278163#(<= (+ |__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 3)), 278172#(<= main_~i~2 10), 278168#(<= main_~i~2 6), 278169#(<= main_~i~2 7), 278170#(<= main_~i~2 8), 278171#(<= main_~i~2 9)] [2018-04-13 00:10:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 484923 backedges. 10543 proven. 1149 refuted. 0 times theorem prover too weak. 473231 trivial. 0 not checked. [2018-04-13 00:10:07,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:10:07,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:10:07,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:10:07,579 INFO L87 Difference]: Start difference. First operand 960 states and 1789 transitions. Second operand 16 states. [2018-04-13 00:10:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:07,787 INFO L93 Difference]: Finished difference Result 5233 states and 10518 transitions. [2018-04-13 00:10:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 00:10:07,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4966 [2018-04-13 00:10:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:07,813 INFO L225 Difference]: With dead ends: 5233 [2018-04-13 00:10:07,813 INFO L226 Difference]: Without dead ends: 5233 [2018-04-13 00:10:07,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-04-13 00:10:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2018-04-13 00:10:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 960. [2018-04-13 00:10:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-04-13 00:10:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1789 transitions. [2018-04-13 00:10:07,880 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1789 transitions. Word has length 4966 [2018-04-13 00:10:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:07,881 INFO L459 AbstractCegarLoop]: Abstraction has 960 states and 1789 transitions. [2018-04-13 00:10:07,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:10:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1789 transitions. [2018-04-13 00:10:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4973 [2018-04-13 00:10:07,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:07,965 INFO L355 BasicCegarLoop]: trace histogram [328, 318, 228, 228, 228, 228, 228, 218, 218, 218, 218, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:07,965 INFO L408 AbstractCegarLoop]: === Iteration 165 === [__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-13 00:10:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1617891126, now seen corresponding path program 142 times [2018-04-13 00:10:07,966 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:08,730 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 486485 backedges. 11413 proven. 1180 refuted. 0 times theorem prover too weak. 473892 trivial. 0 not checked. [2018-04-13 00:10:17,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:17,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:10:17,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 183374 backedges. 1531 proven. 136 refuted. 0 times theorem prover too weak. 181707 trivial. 0 not checked. [2018-04-13 00:10:17,778 INFO L182 omatonBuilderFactory]: Interpolants [284388#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 284389#(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)), 284390#(<= (+ |__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)), 284391#(<= (+ |__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 2)), 284386#true, 284387#false, 284396#(<= main_~i~2 5), 284397#(<= main_~i~2 6), 284398#(<= main_~i~2 7), 284399#(<= main_~i~2 8), 284392#(<= (+ |__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 3)), 284393#(<= (+ |__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 4)), 284394#(<= (+ |__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 5)), 284395#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 284400#(<= main_~i~2 9), 284401#(<= main_~i~2 10)] [2018-04-13 00:10:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 486485 backedges. 11413 proven. 1180 refuted. 0 times theorem prover too weak. 473892 trivial. 0 not checked. [2018-04-13 00:10:17,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:10:17,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:10:17,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:10:17,783 INFO L87 Difference]: Start difference. First operand 960 states and 1789 transitions. Second operand 16 states. [2018-04-13 00:10:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:18,025 INFO L93 Difference]: Finished difference Result 4621 states and 9202 transitions. [2018-04-13 00:10:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 00:10:18,025 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4972 [2018-04-13 00:10:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:18,047 INFO L225 Difference]: With dead ends: 4621 [2018-04-13 00:10:18,047 INFO L226 Difference]: Without dead ends: 4621 [2018-04-13 00:10:18,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2018-04-13 00:10:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2018-04-13 00:10:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 960. [2018-04-13 00:10:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-04-13 00:10:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1789 transitions. [2018-04-13 00:10:18,108 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1789 transitions. Word has length 4972 [2018-04-13 00:10:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:18,109 INFO L459 AbstractCegarLoop]: Abstraction has 960 states and 1789 transitions. [2018-04-13 00:10:18,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:10:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1789 transitions. [2018-04-13 00:10:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4979 [2018-04-13 00:10:18,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:18,198 INFO L355 BasicCegarLoop]: trace histogram [329, 318, 229, 229, 229, 229, 229, 218, 218, 218, 218, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:18,198 INFO L408 AbstractCegarLoop]: === Iteration 166 === [__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-13 00:10:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1116701748, now seen corresponding path program 143 times [2018-04-13 00:10:18,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:18,752 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 488053 backedges. 12371 proven. 1122 refuted. 0 times theorem prover too weak. 474560 trivial. 0 not checked. [2018-04-13 00:10:25,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:25,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:10:25,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 183398 backedges. 1571 proven. 120 refuted. 0 times theorem prover too weak. 181707 trivial. 0 not checked. [2018-04-13 00:10:25,484 INFO L182 omatonBuilderFactory]: Interpolants [290020#(<= main_~i~2 8), 290021#(<= main_~i~2 9), 290022#(<= main_~i~2 10), 290016#(<= (+ |__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 6)), 290017#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 6), 290018#(<= main_~i~2 6), 290019#(<= main_~i~2 7), 290007#true, 290012#(<= (+ |__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 2)), 290013#(<= (+ |__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 3)), 290014#(<= (+ |__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 4)), 290015#(<= (+ |__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 5)), 290008#false, 290009#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 290010#(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)), 290011#(<= (+ |__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))] [2018-04-13 00:10:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 488053 backedges. 12371 proven. 1122 refuted. 0 times theorem prover too weak. 474560 trivial. 0 not checked. [2018-04-13 00:10:25,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:10:25,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:10:25,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:10:25,489 INFO L87 Difference]: Start difference. First operand 960 states and 1789 transitions. Second operand 16 states. [2018-04-13 00:10:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:25,726 INFO L93 Difference]: Finished difference Result 4003 states and 8341 transitions. [2018-04-13 00:10:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 00:10:25,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4978 [2018-04-13 00:10:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:25,749 INFO L225 Difference]: With dead ends: 4003 [2018-04-13 00:10:25,749 INFO L226 Difference]: Without dead ends: 4003 [2018-04-13 00:10:25,749 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2018-04-13 00:10:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2018-04-13 00:10:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 968. [2018-04-13 00:10:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-04-13 00:10:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1895 transitions. [2018-04-13 00:10:25,811 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1895 transitions. Word has length 4978 [2018-04-13 00:10:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:25,812 INFO L459 AbstractCegarLoop]: Abstraction has 968 states and 1895 transitions. [2018-04-13 00:10:25,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:10:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1895 transitions. [2018-04-13 00:10:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4985 [2018-04-13 00:10:25,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:25,907 INFO L355 BasicCegarLoop]: trace histogram [330, 318, 230, 230, 230, 230, 230, 218, 218, 218, 218, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:25,907 INFO L408 AbstractCegarLoop]: === Iteration 167 === [__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-13 00:10:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1301470986, now seen corresponding path program 144 times [2018-04-13 00:10:25,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:26,425 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 489627 backedges. 19317 proven. 1643 refuted. 0 times theorem prover too weak. 468667 trivial. 0 not checked. [2018-04-13 00:10:33,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:33,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:10:33,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 183410 backedges. 2736 proven. 205 refuted. 0 times theorem prover too weak. 180469 trivial. 0 not checked. [2018-04-13 00:10:33,231 INFO L182 omatonBuilderFactory]: Interpolants [295022#true, 295023#false, 295028#(<= (+ |__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 3)), 295029#(<= (+ |__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 4)), 295030#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 4), 295031#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 4), 295024#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 295025#(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)), 295026#(<= (+ |__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)), 295027#(<= (+ |__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 2)), 295036#(<= main_~i~2 8), 295032#(<= main_~i~2 4), 295033#(<= main_~i~2 5), 295034#(<= main_~i~2 6), 295035#(<= main_~i~2 7)] [2018-04-13 00:10:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 489627 backedges. 19317 proven. 1643 refuted. 0 times theorem prover too weak. 468667 trivial. 0 not checked. [2018-04-13 00:10:33,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:10:33,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:10:33,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:10:33,236 INFO L87 Difference]: Start difference. First operand 968 states and 1895 transitions. Second operand 15 states. [2018-04-13 00:10:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:33,369 INFO L93 Difference]: Finished difference Result 4043 states and 10766 transitions. [2018-04-13 00:10:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 00:10:33,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 4984 [2018-04-13 00:10:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:33,390 INFO L225 Difference]: With dead ends: 4043 [2018-04-13 00:10:33,390 INFO L226 Difference]: Without dead ends: 4043 [2018-04-13 00:10:33,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-04-13 00:10:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4043 states. [2018-04-13 00:10:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4043 to 960. [2018-04-13 00:10:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-04-13 00:10:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1789 transitions. [2018-04-13 00:10:33,460 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1789 transitions. Word has length 4984 [2018-04-13 00:10:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:33,462 INFO L459 AbstractCegarLoop]: Abstraction has 960 states and 1789 transitions. [2018-04-13 00:10:33,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:10:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1789 transitions. [2018-04-13 00:10:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4990 [2018-04-13 00:10:33,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:33,546 INFO L355 BasicCegarLoop]: trace histogram [330, 319, 230, 230, 230, 230, 230, 219, 219, 219, 219, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:33,546 INFO L408 AbstractCegarLoop]: === Iteration 168 === [__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-13 00:10:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1981252609, now seen corresponding path program 145 times [2018-04-13 00:10:33,547 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:34,093 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 490917 backedges. 13435 proven. 957 refuted. 0 times theorem prover too weak. 476525 trivial. 0 not checked. [2018-04-13 00:10:40,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:40,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:10:40,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 183425 backedges. 1617 proven. 92 refuted. 0 times theorem prover too weak. 181716 trivial. 0 not checked. [2018-04-13 00:10:40,871 INFO L182 omatonBuilderFactory]: Interpolants [300064#(<= main_~i~2 7), 300065#(<= main_~i~2 8), 300066#(<= main_~i~2 9), 300067#(<= main_~i~2 10), 300052#true, 300053#false, 300054#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 300055#(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)), 300060#(<= (+ |__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 5)), 300061#(<= (+ |__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 6)), 300062#(<= (+ |__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 7)), 300063#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 7), 300056#(<= (+ |__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)), 300057#(<= (+ |__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 2)), 300058#(<= (+ |__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 3)), 300059#(<= (+ |__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 4))] [2018-04-13 00:10:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 490917 backedges. 13435 proven. 957 refuted. 0 times theorem prover too weak. 476525 trivial. 0 not checked. [2018-04-13 00:10:40,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:10:40,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:10:40,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:10:40,876 INFO L87 Difference]: Start difference. First operand 960 states and 1789 transitions. Second operand 16 states. [2018-04-13 00:10:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:41,146 INFO L93 Difference]: Finished difference Result 3379 states and 7659 transitions. [2018-04-13 00:10:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 00:10:41,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 4989 [2018-04-13 00:10:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:41,167 INFO L225 Difference]: With dead ends: 3379 [2018-04-13 00:10:41,167 INFO L226 Difference]: Without dead ends: 3379 [2018-04-13 00:10:41,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=284, Invalid=708, Unknown=0, NotChecked=0, Total=992 [2018-04-13 00:10:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2018-04-13 00:10:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 968. [2018-04-13 00:10:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-04-13 00:10:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1895 transitions. [2018-04-13 00:10:41,222 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1895 transitions. Word has length 4989 [2018-04-13 00:10:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:41,223 INFO L459 AbstractCegarLoop]: Abstraction has 968 states and 1895 transitions. [2018-04-13 00:10:41,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:10:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1895 transitions. [2018-04-13 00:10:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5001 [2018-04-13 00:10:41,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:41,313 INFO L355 BasicCegarLoop]: trace histogram [331, 320, 231, 231, 231, 231, 231, 220, 220, 220, 220, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:41,313 INFO L408 AbstractCegarLoop]: === Iteration 169 === [__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-13 00:10:41,313 INFO L82 PathProgramCache]: Analyzing trace with hash 344458230, now seen corresponding path program 146 times [2018-04-13 00:10:41,314 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:41,878 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 493792 backedges. 14623 proven. 667 refuted. 0 times theorem prover too weak. 478502 trivial. 0 not checked. [2018-04-13 00:10:48,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:48,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:10:48,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 183447 backedges. 1669 proven. 52 refuted. 0 times theorem prover too weak. 181726 trivial. 0 not checked. [2018-04-13 00:10:48,660 INFO L182 omatonBuilderFactory]: Interpolants [304452#(<= (+ |__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 2)), 304453#(<= (+ |__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 3)), 304454#(<= (+ |__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 4)), 304455#(<= (+ |__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 5)), 304448#false, 304449#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 304450#(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)), 304451#(<= (+ |__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)), 304460#(<= main_~i~2 8), 304461#(<= main_~i~2 9), 304462#(<= main_~i~2 10), 304456#(<= (+ |__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 6)), 304457#(<= (+ |__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 7)), 304458#(<= (+ |__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 8)), 304459#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 8), 304447#true] [2018-04-13 00:10:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 493792 backedges. 14623 proven. 667 refuted. 0 times theorem prover too weak. 478502 trivial. 0 not checked. [2018-04-13 00:10:48,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:10:48,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:10:48,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:10:48,666 INFO L87 Difference]: Start difference. First operand 968 states and 1895 transitions. Second operand 16 states. [2018-04-13 00:10:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:48,949 INFO L93 Difference]: Finished difference Result 2753 states and 6872 transitions. [2018-04-13 00:10:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 00:10:48,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 5000 [2018-04-13 00:10:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:48,968 INFO L225 Difference]: With dead ends: 2753 [2018-04-13 00:10:48,968 INFO L226 Difference]: Without dead ends: 2753 [2018-04-13 00:10:48,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=339, Invalid=783, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 00:10:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2018-04-13 00:10:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 968. [2018-04-13 00:10:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-04-13 00:10:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1895 transitions. [2018-04-13 00:10:49,025 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1895 transitions. Word has length 5000 [2018-04-13 00:10:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:49,026 INFO L459 AbstractCegarLoop]: Abstraction has 968 states and 1895 transitions. [2018-04-13 00:10:49,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 00:10:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1895 transitions. [2018-04-13 00:10:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5002 [2018-04-13 00:10:49,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:49,116 INFO L355 BasicCegarLoop]: trace histogram [332, 319, 232, 232, 232, 232, 232, 219, 219, 219, 219, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:49,116 INFO L408 AbstractCegarLoop]: === Iteration 170 === [__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-13 00:10:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash -541435795, now seen corresponding path program 147 times [2018-04-13 00:10:49,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:49,737 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 00:10:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 494083 backedges. 21747 proven. 1414 refuted. 0 times theorem prover too weak. 470922 trivial. 0 not checked. [2018-04-13 00:10:56,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:10:56,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 00:10:56,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:10:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 183437 backedges. 2803 proven. 158 refuted. 0 times theorem prover too weak. 180476 trivial. 0 not checked. [2018-04-13 00:10:56,688 INFO L182 omatonBuilderFactory]: Interpolants [308228#(<= (+ |__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 5)), 308229#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar_#in~size| 5), 308230#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 5), 308231#(<= main_~i~2 5), 308224#(<= (+ |__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)), 308225#(<= (+ |__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 2)), 308226#(<= (+ |__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 3)), 308227#(<= (+ |__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 4)), 308232#(<= main_~i~2 6), 308233#(<= main_~i~2 7), 308234#(<= main_~i~2 8), 308220#true, 308221#false, 308222#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 308223#(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))] [2018-04-13 00:10:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 494083 backedges. 21747 proven. 1414 refuted. 0 times theorem prover too weak. 470922 trivial. 0 not checked. [2018-04-13 00:10:56,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 00:10:56,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 00:10:56,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-04-13 00:10:56,693 INFO L87 Difference]: Start difference. First operand 968 states and 1895 transitions. Second operand 15 states. [2018-04-13 00:10:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 00:10:56,850 INFO L93 Difference]: Finished difference Result 3419 states and 9624 transitions. [2018-04-13 00:10:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 00:10:56,851 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 5001 [2018-04-13 00:10:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 00:10:56,874 INFO L225 Difference]: With dead ends: 3419 [2018-04-13 00:10:56,874 INFO L226 Difference]: Without dead ends: 3419 [2018-04-13 00:10:56,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-04-13 00:10:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2018-04-13 00:10:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 968. [2018-04-13 00:10:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-04-13 00:10:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1895 transitions. [2018-04-13 00:10:56,943 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1895 transitions. Word has length 5001 [2018-04-13 00:10:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 00:10:56,944 INFO L459 AbstractCegarLoop]: Abstraction has 968 states and 1895 transitions. [2018-04-13 00:10:56,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 00:10:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1895 transitions. [2018-04-13 00:10:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5012 [2018-04-13 00:10:57,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 00:10:57,034 INFO L355 BasicCegarLoop]: trace histogram [332, 321, 232, 232, 232, 232, 232, 221, 221, 221, 221, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 00:10:57,034 INFO L408 AbstractCegarLoop]: === Iteration 171 === [__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-13 00:10:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1887530027, now seen corresponding path program 148 times [2018-04-13 00:10:57,034 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 00:10:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 00:10:57,648 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-13 00:11:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 496678 backedges. 15953 proven. 234 refuted. 0 times theorem prover too weak. 480491 trivial. 0 not checked. [2018-04-13 00:11:04,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 00:11:04,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 00:11:04,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 00:11:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 183458 backedges. 1727 proven. 0 refuted. 0 times theorem prover too weak. 181731 trivial. 0 not checked. [2018-04-13 00:11:04,658 INFO L182 omatonBuilderFactory]: Interpolants [312644#(<= (+ |__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 5)), 312645#(<= (+ |__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 6)), 312646#(<= (+ |__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 7)), 312647#(<= (+ |__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 8)), 312640#(<= (+ |__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)), 312641#(<= (+ |__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 2)), 312642#(<= (+ |__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 3)), 312643#(<= (+ |__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 4)), 312648#(<= (+ |__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 9)), 312649#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| 9), 312650#(<= main_~i~2 9), 312651#(<= main_~i~2 10), 312636#true, 312637#false, 312638#(<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size), 312639#(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))] [2018-04-13 00:11:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 496678 backedges. 15953 proven. 234 refuted. 0 times theorem prover too weak. 480491 trivial. 0 not checked. [2018-04-13 00:11:04,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 00:11:04,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 00:11:04,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-04-13 00:11:04,664 INFO L87 Difference]: Start difference. First operand 968 states and 1895 transitions. Second operand 16 states. [2018-04-13 00:11:04,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-13 00:11:04,664 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 00:11:04,668 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 00:11:04,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 12:11:04 BoogieIcfgContainer [2018-04-13 00:11:04,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 00:11:04,668 INFO L168 Benchmark]: Toolchain (without parser) took 752064.89 ms. Allocated memory was 400.6 MB in the beginning and 4.6 GB in the end (delta: 4.2 GB). Free memory was 343.5 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 5.3 GB. [2018-04-13 00:11:04,669 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 400.6 MB. Free memory is still 363.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 00:11:04,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.98 ms. Allocated memory is still 400.6 MB. Free memory was 343.5 MB in the beginning and 332.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-13 00:11:04,669 INFO L168 Benchmark]: Boogie Preprocessor took 28.89 ms. Allocated memory is still 400.6 MB. Free memory was 332.8 MB in the beginning and 331.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 00:11:04,670 INFO L168 Benchmark]: RCFGBuilder took 246.01 ms. Allocated memory was 400.6 MB in the beginning and 602.9 MB in the end (delta: 202.4 MB). Free memory was 331.5 MB in the beginning and 561.4 MB in the end (delta: -229.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. [2018-04-13 00:11:04,670 INFO L168 Benchmark]: TraceAbstraction took 751627.63 ms. Allocated memory was 602.9 MB in the beginning and 4.6 GB in the end (delta: 4.0 GB). Free memory was 561.4 MB in the beginning and 1.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 5.3 GB. [2018-04-13 00:11:04,671 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.11 ms. Allocated memory is still 400.6 MB. Free memory is still 363.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.98 ms. Allocated memory is still 400.6 MB. Free memory was 343.5 MB in the beginning and 332.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 28.89 ms. Allocated memory is still 400.6 MB. Free memory was 332.8 MB in the beginning and 331.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 246.01 ms. Allocated memory was 400.6 MB in the beginning and 602.9 MB in the end (delta: 202.4 MB). Free memory was 331.5 MB in the beginning and 561.4 MB in the end (delta: -229.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 751627.63 ms. Allocated memory was 602.9 MB in the beginning and 4.6 GB in the end (delta: 4.0 GB). Free memory was 561.4 MB in the beginning and 1.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (968states) and interpolant automaton (currently 2 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 68 locations, 11 error locations. TIMEOUT Result, 751.5s OverallTime, 171 OverallIterations, 332 TraceHistogramMax, 59.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13237 SDtfs, 32724 SDslu, 133982 SDs, 0 SdLazy, 132288 SolverSat, 7457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6675 GetRequests, 357 SyntacticMatches, 7 SemanticMatches, 6311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4366 ImplicationChecksByTransitivity, 75.7s Time, 0.6s BasicInterpolantAutomatonTime, BiggestAbstraction: size=968occurred in iteration=166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 35441587/36610011 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 170 MinimizatonAttempts, 115946 StatesRemovedByMinimization, 161 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.2s SsaConstructionTime, 44.9s SatisfiabilityAnalysisTime, 187.9s InterpolantComputationTime, 478848 NumberOfCodeBlocks, 478848 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 478677 ConstructedInterpolants, 0 QuantifiedInterpolants, 2202051874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 171 InterpolantComputations, 11 PerfectInterpolantSequences, 35441587/36610011 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_00-11-04-675.csv 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-TraceAbstractionBenchmarks-0-2018-04-13_00-11-04-675.csv Completed graceful shutdown