java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:59:38,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:59:38,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:59:38,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:59:38,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:59:38,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:59:38,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:59:38,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:59:38,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:59:38,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:59:38,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:59:38,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:59:38,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:59:38,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:59:38,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:59:38,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:59:38,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:59:38,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:59:38,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:59:38,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:59:38,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:59:38,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:59:38,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:59:38,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:59:38,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:59:38,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:59:38,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:59:38,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:59:38,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:59:38,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:59:38,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:59:38,338 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-10 14:59:38,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:59:38,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:59:38,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:59:38,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:59:38,353 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:59:38,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:59:38,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:59:38,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:59:38,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:59:38,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:59:38,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:59:38,354 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:59:38,355 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:59:38,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:59:38,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:59:38,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:59:38,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:59:38,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:59:38,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:59:38,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:59:38,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:59:38,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-04-10 14:59:38,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:59:38,393 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:59:38,396 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:59:38,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:59:38,397 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:59:38,398 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-10 14:59:38,664 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG30221546a [2018-04-10 14:59:38,753 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:59:38,754 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:59:38,754 INFO L168 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 14:59:38,755 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:59:38,755 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:59:38,755 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:59:38,756 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 14:59:38,756 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 14:59:38,756 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 14:59:38,756 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:59:38,756 INFO L233 ultiparseSymbolTable]: [2018-04-10 14:59:38,770 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG30221546a [2018-04-10 14:59:38,773 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:59:38,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:59:38,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:59:38,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:59:38,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:59:38,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7fe884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38, skipping insertion in model container [2018-04-10 14:59:38,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,791 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:59:38,800 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:59:38,896 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:59:38,917 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:59:38,922 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-04-10 14:59:38,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38 WrapperNode [2018-04-10 14:59:38,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:59:38,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:59:38,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:59:38,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:59:38,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... [2018-04-10 14:59:38,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:59:38,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:59:38,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:59:38,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:59:38,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:59:39,001 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:59:39,001 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:59:39,002 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-10 14:59:39,002 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-10 14:59:39,002 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:59:39,002 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-10 14:59:39,002 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:59:39,002 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:59:39,003 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:59:39,228 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:59:39,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:59:39 BoogieIcfgContainer [2018-04-10 14:59:39,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:59:39,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:59:39,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:59:39,232 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:59:39,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:59:38" (1/3) ... [2018-04-10 14:59:39,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd04be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:59:39, skipping insertion in model container [2018-04-10 14:59:39,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:59:38" (2/3) ... [2018-04-10 14:59:39,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd04be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:59:39, skipping insertion in model container [2018-04-10 14:59:39,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:59:39" (3/3) ... [2018-04-10 14:59:39,235 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-10 14:59:39,243 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:59:39,248 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-10 14:59:39,273 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:59:39,273 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:59:39,274 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:59:39,274 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-10 14:59:39,274 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 14:59:39,274 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:59:39,274 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:59:39,274 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:59:39,274 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:59:39,275 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:59:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-04-10 14:59:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-10 14:59:39,292 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:39,292 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:59:39,293 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-10 14:59:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-04-10 14:59:39,325 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:39,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:39,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 14:59:39,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,371 INFO L182 omatonBuilderFactory]: Interpolants [71#true, 72#false] [2018-04-10 14:59:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-10 14:59:39,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-10 14:59:39,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-10 14:59:39,383 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-04-10 14:59:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:39,398 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-10 14:59:39,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 14:59:39,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-10 14:59:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:39,404 INFO L225 Difference]: With dead ends: 68 [2018-04-10 14:59:39,405 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 14:59:39,406 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-10 14:59:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 14:59:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-10 14:59:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 14:59:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-10 14:59:39,432 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-04-10 14:59:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:39,433 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-10 14:59:39,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-10 14:59:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-10 14:59:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 14:59:39,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:39,433 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:59:39,433 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-10 14:59:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-04-10 14:59:39,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:39,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:39,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:59:39,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,478 INFO L182 omatonBuilderFactory]: Interpolants [208#(= main_~i~2 0), 206#true, 207#false] [2018-04-10 14:59:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:59:39,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:59:39,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:59:39,480 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-04-10 14:59:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:39,527 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-10 14:59:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:59:39,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-10 14:59:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:39,530 INFO L225 Difference]: With dead ends: 71 [2018-04-10 14:59:39,530 INFO L226 Difference]: Without dead ends: 71 [2018-04-10 14:59:39,530 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-10 14:59:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-10 14:59:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-04-10 14:59:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-10 14:59:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-10 14:59:39,539 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-04-10 14:59:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:39,539 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-10 14:59:39,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:59:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-10 14:59:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:59:39,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:39,540 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:59:39,540 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-10 14:59:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-04-10 14:59:39,541 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:39,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:39,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:59:39,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,628 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-10 14:59:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:59:39,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:59:39,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:59:39,629 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-04-10 14:59:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:39,713 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-10 14:59:39,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:59:39,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 14:59:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:39,714 INFO L225 Difference]: With dead ends: 85 [2018-04-10 14:59:39,714 INFO L226 Difference]: Without dead ends: 85 [2018-04-10 14:59:39,715 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-10 14:59:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-10 14:59:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-04-10 14:59:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-10 14:59:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-10 14:59:39,721 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-04-10 14:59:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:39,721 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-10 14:59:39,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:59:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-10 14:59:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 14:59:39,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:39,722 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-10 14:59:39,722 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-10 14:59:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-04-10 14:59:39,723 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:39,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:39,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:59:39,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,766 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-10 14:59:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:59:39,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:59:39,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:59:39,766 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-04-10 14:59:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:39,821 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-04-10 14:59:39,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:59:39,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-10 14:59:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:39,823 INFO L225 Difference]: With dead ends: 77 [2018-04-10 14:59:39,824 INFO L226 Difference]: Without dead ends: 77 [2018-04-10 14:59:39,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:59:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-10 14:59:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-10 14:59:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-10 14:59:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-10 14:59:39,829 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-04-10 14:59:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:39,829 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-10 14:59:39,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:59:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-10 14:59:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 14:59:39,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:39,830 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-10 14:59:39,830 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-10 14:59:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-04-10 14:59:39,831 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:39,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:39,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:59:39,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,900 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-10 14:59:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:39,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:59:39,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:59:39,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:59:39,902 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-04-10 14:59:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:39,987 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-10 14:59:39,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:59:39,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-10 14:59:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:39,988 INFO L225 Difference]: With dead ends: 89 [2018-04-10 14:59:39,988 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 14:59:39,988 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-10 14:59:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 14:59:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-04-10 14:59:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-10 14:59:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-10 14:59:39,992 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-10 14:59:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:39,992 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-10 14:59:39,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:59:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-10 14:59:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:59:39,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:39,993 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-10 14:59:39,993 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-10 14:59:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-04-10 14:59:39,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:40,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:40,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:59:40,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,046 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-10 14:59:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:59:40,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:59:40,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:59:40,048 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-04-10 14:59:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:40,067 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-10 14:59:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:59:40,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 14:59:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:40,068 INFO L225 Difference]: With dead ends: 91 [2018-04-10 14:59:40,068 INFO L226 Difference]: Without dead ends: 91 [2018-04-10 14:59:40,069 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-10 14:59:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-10 14:59:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-04-10 14:59:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-10 14:59:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-10 14:59:40,072 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-04-10 14:59:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:40,073 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-10 14:59:40,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:59:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-10 14:59:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:59:40,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:40,073 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-10 14:59:40,073 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-10 14:59:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-04-10 14:59:40,074 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:40,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:40,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:59:40,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,157 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-10 14:59:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:59:40,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:59:40,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:59:40,158 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-04-10 14:59:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:40,266 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-04-10 14:59:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:59:40,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 14:59:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:40,267 INFO L225 Difference]: With dead ends: 86 [2018-04-10 14:59:40,267 INFO L226 Difference]: Without dead ends: 86 [2018-04-10 14:59:40,267 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-10 14:59:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-10 14:59:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-10 14:59:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-10 14:59:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-10 14:59:40,271 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-04-10 14:59:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:40,272 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-10 14:59:40,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:59:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-10 14:59:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:59:40,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:40,273 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-10 14:59:40,273 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-10 14:59:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-04-10 14:59:40,274 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:40,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:40,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:59:40,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,386 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-10 14:59:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:59:40,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:59:40,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:59:40,388 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-04-10 14:59:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:40,593 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-04-10 14:59:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:59:40,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-10 14:59:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:40,594 INFO L225 Difference]: With dead ends: 101 [2018-04-10 14:59:40,594 INFO L226 Difference]: Without dead ends: 101 [2018-04-10 14:59:40,594 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-10 14:59:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-10 14:59:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-04-10 14:59:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-10 14:59:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-04-10 14:59:40,598 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-04-10 14:59:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:40,598 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-04-10 14:59:40,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:59:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-04-10 14:59:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:59:40,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:40,599 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-10 14:59:40,599 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-10 14:59:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-04-10 14:59:40,600 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:40,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:40,669 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-10 14:59:40,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:40,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:59:40,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,671 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-10 14:59:40,671 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-10 14:59:40,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:59:40,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:59:40,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:59:40,672 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-04-10 14:59:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:40,735 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-04-10 14:59:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:59:40,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-10 14:59:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:40,736 INFO L225 Difference]: With dead ends: 96 [2018-04-10 14:59:40,736 INFO L226 Difference]: Without dead ends: 96 [2018-04-10 14:59:40,737 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-10 14:59:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-10 14:59:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-10 14:59:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-10 14:59:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-04-10 14:59:40,741 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-04-10 14:59:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:40,741 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-04-10 14:59:40,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:59:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-04-10 14:59:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:59:40,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:40,743 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-10 14:59:40,743 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-10 14:59:40,743 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-04-10 14:59:40,743 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:40,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:40,944 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-10 14:59:40,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:40,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:59:40,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:40,945 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-10 14:59:40,945 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-10 14:59:40,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:59:40,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:59:40,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:59:40,946 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 11 states. [2018-04-10 14:59:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:41,173 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2018-04-10 14:59:41,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:59:41,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-10 14:59:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:41,174 INFO L225 Difference]: With dead ends: 129 [2018-04-10 14:59:41,174 INFO L226 Difference]: Without dead ends: 129 [2018-04-10 14:59:41,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:59:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-10 14:59:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2018-04-10 14:59:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-10 14:59:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-04-10 14:59:41,179 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 42 [2018-04-10 14:59:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:41,179 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-04-10 14:59:41,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:59:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-04-10 14:59:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 14:59:41,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:41,181 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-10 14:59:41,181 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-10 14:59:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-04-10 14:59:41,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:41,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:41,277 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-10 14:59:41,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:41,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:59:41,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:41,278 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-10 14:59:41,278 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-10 14:59:41,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:59:41,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:59:41,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:59:41,279 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 8 states. [2018-04-10 14:59:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:41,387 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-04-10 14:59:41,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:59:41,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-04-10 14:59:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:41,388 INFO L225 Difference]: With dead ends: 114 [2018-04-10 14:59:41,388 INFO L226 Difference]: Without dead ends: 114 [2018-04-10 14:59:41,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:59:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-10 14:59:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-04-10 14:59:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-10 14:59:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-04-10 14:59:41,392 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 43 [2018-04-10 14:59:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:41,392 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-04-10 14:59:41,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:59:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-04-10 14:59:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:59:41,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:41,393 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-10 14:59:41,393 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-10 14:59:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-04-10 14:59:41,394 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:41,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:41,464 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-10 14:59:41,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:41,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 14:59:41,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:41,465 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-10 14:59:41,466 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-10 14:59:41,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:59:41,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:59:41,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:59:41,466 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-04-10 14:59:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:41,555 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-04-10 14:59:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:59:41,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-10 14:59:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:41,556 INFO L225 Difference]: With dead ends: 127 [2018-04-10 14:59:41,556 INFO L226 Difference]: Without dead ends: 127 [2018-04-10 14:59:41,557 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-10 14:59:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-10 14:59:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-04-10 14:59:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 14:59:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-10 14:59:41,562 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 46 [2018-04-10 14:59:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:41,562 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-10 14:59:41,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:59:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-10 14:59:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 14:59:41,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:41,564 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-10 14:59:41,564 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-10 14:59:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-04-10 14:59:41,565 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:41,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:41,627 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-10 14:59:41,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:59:41,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:59:41,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:41,628 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-10 14:59:41,628 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-10 14:59:41,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:59:41,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:59:41,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:59:41,629 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 6 states. [2018-04-10 14:59:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:41,697 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-04-10 14:59:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:59:41,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-10 14:59:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:41,698 INFO L225 Difference]: With dead ends: 126 [2018-04-10 14:59:41,698 INFO L226 Difference]: Without dead ends: 126 [2018-04-10 14:59:41,699 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-10 14:59:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-10 14:59:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-04-10 14:59:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-10 14:59:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-04-10 14:59:41,703 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 52 [2018-04-10 14:59:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:41,703 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-04-10 14:59:41,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:59:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-04-10 14:59:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 14:59:41,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:41,704 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-10 14:59:41,705 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-10 14:59:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-04-10 14:59:41,705 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:41,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:41,805 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-10 14:59:41,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:41,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 14:59:41,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:41,806 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-10 14:59:41,806 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-10 14:59:41,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:59:41,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:59:41,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:59:41,806 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 11 states. [2018-04-10 14:59:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:41,934 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-04-10 14:59:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:59:41,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-04-10 14:59:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:41,935 INFO L225 Difference]: With dead ends: 138 [2018-04-10 14:59:41,936 INFO L226 Difference]: Without dead ends: 138 [2018-04-10 14:59:41,936 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-10 14:59:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-10 14:59:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-04-10 14:59:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 14:59:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-10 14:59:41,940 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-04-10 14:59:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:41,940 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-10 14:59:41,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:59:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-10 14:59:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:59:41,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:41,942 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-10 14:59:41,942 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-10 14:59:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-04-10 14:59:41,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:41,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:42,071 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-10 14:59:42,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:42,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 14:59:42,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:42,072 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-10 14:59:42,072 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-10 14:59:42,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:59:42,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:59:42,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:59:42,073 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 9 states. [2018-04-10 14:59:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:42,187 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-04-10 14:59:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:59:42,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-04-10 14:59:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:42,189 INFO L225 Difference]: With dead ends: 146 [2018-04-10 14:59:42,189 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 14:59:42,190 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-10 14:59:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 14:59:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-04-10 14:59:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 14:59:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-04-10 14:59:42,193 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-04-10 14:59:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:42,194 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-04-10 14:59:42,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:59:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-04-10 14:59:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 14:59:42,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:42,195 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-10 14:59:42,195 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-10 14:59:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-04-10 14:59:42,196 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:42,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:42,428 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-10 14:59:42,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:42,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 14:59:42,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:42,429 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-10 14:59:42,430 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-10 14:59:42,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:59:42,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:59:42,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:59:42,430 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 16 states. [2018-04-10 14:59:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:42,726 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-04-10 14:59:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:59:42,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-10 14:59:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:42,727 INFO L225 Difference]: With dead ends: 141 [2018-04-10 14:59:42,727 INFO L226 Difference]: Without dead ends: 141 [2018-04-10 14:59:42,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:59:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-10 14:59:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-04-10 14:59:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 14:59:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2018-04-10 14:59:42,732 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 67 [2018-04-10 14:59:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:42,732 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2018-04-10 14:59:42,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:59:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2018-04-10 14:59:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-10 14:59:42,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:42,733 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-10 14:59:42,733 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-10 14:59:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1765271438, now seen corresponding path program 1 times [2018-04-10 14:59:42,734 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:42,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:42,860 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-10 14:59:42,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:42,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:59:42,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:42,860 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-10 14:59:42,861 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-10 14:59:42,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:59:42,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:59:42,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:59:42,861 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 11 states. [2018-04-10 14:59:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:43,005 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-10 14:59:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 14:59:43,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-04-10 14:59:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:43,006 INFO L225 Difference]: With dead ends: 134 [2018-04-10 14:59:43,006 INFO L226 Difference]: Without dead ends: 134 [2018-04-10 14:59:43,007 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-10 14:59:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-10 14:59:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-04-10 14:59:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 14:59:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-10 14:59:43,009 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 78 [2018-04-10 14:59:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:43,009 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-10 14:59:43,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:59:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-10 14:59:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 14:59:43,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:43,010 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-10 14:59:43,010 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-10 14:59:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1591994525, now seen corresponding path program 1 times [2018-04-10 14:59:43,011 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:43,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:43,051 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-10 14:59:43,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:43,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 14:59:43,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:43,052 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-10 14:59:43,052 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-10 14:59:43,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:59:43,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:59:43,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:59:43,053 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 5 states. [2018-04-10 14:59:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:43,083 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-04-10 14:59:43,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:59:43,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-04-10 14:59:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:43,084 INFO L225 Difference]: With dead ends: 136 [2018-04-10 14:59:43,084 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 14:59:43,085 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-10 14:59:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 14:59:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2018-04-10 14:59:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 14:59:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-10 14:59:43,088 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 80 [2018-04-10 14:59:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:43,089 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-10 14:59:43,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:59:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-10 14:59:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 14:59:43,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:43,090 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-10 14:59:43,090 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-10 14:59:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1581116616, now seen corresponding path program 2 times [2018-04-10 14:59:43,091 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:43,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:43,244 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-10 14:59:43,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:43,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:59:43,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:43,245 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-10 14:59:43,245 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-10 14:59:43,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:59:43,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:59:43,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:59:43,246 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 13 states. [2018-04-10 14:59:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:43,468 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-04-10 14:59:43,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:59:43,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-04-10 14:59:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:43,468 INFO L225 Difference]: With dead ends: 136 [2018-04-10 14:59:43,468 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 14:59:43,469 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-10 14:59:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 14:59:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-04-10 14:59:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 14:59:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-04-10 14:59:43,472 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 84 [2018-04-10 14:59:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:43,473 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-04-10 14:59:43,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:59:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-04-10 14:59:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-10 14:59:43,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:43,474 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-10 14:59:43,474 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-10 14:59:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1044060343, now seen corresponding path program 1 times [2018-04-10 14:59:43,481 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:43,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:43,616 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-10 14:59:43,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:43,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 14:59:43,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:43,617 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-10 14:59:43,617 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-10 14:59:43,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:59:43,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:59:43,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:59:43,618 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 10 states. [2018-04-10 14:59:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:43,711 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-04-10 14:59:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:59:43,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-04-10 14:59:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:43,712 INFO L225 Difference]: With dead ends: 129 [2018-04-10 14:59:43,712 INFO L226 Difference]: Without dead ends: 129 [2018-04-10 14:59:43,712 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-10 14:59:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-10 14:59:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-04-10 14:59:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-10 14:59:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-04-10 14:59:43,715 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 93 [2018-04-10 14:59:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:43,715 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-04-10 14:59:43,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:59:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-04-10 14:59:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-10 14:59:43,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:43,716 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-10 14:59:43,716 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-10 14:59:43,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1115175640, now seen corresponding path program 2 times [2018-04-10 14:59:43,717 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:43,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:43,831 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-10 14:59:43,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:43,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:59:43,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:43,832 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-10 14:59:43,832 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-10 14:59:43,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:59:43,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:59:43,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:59:43,833 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 12 states. [2018-04-10 14:59:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:44,081 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-10 14:59:44,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:59:44,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-04-10 14:59:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:44,082 INFO L225 Difference]: With dead ends: 164 [2018-04-10 14:59:44,082 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 14:59:44,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:59:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 14:59:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2018-04-10 14:59:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-10 14:59:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-10 14:59:44,086 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 103 [2018-04-10 14:59:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:44,086 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-10 14:59:44,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:59:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-10 14:59:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-10 14:59:44,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:44,087 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-10 14:59:44,088 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-10 14:59:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash -260385982, now seen corresponding path program 3 times [2018-04-10 14:59:44,088 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:44,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:44,254 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-10 14:59:44,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:44,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:59:44,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:44,255 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-10 14:59:44,255 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-10 14:59:44,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:59:44,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:59:44,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:59:44,255 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 12 states. [2018-04-10 14:59:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:44,381 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-04-10 14:59:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:59:44,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-04-10 14:59:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:44,382 INFO L225 Difference]: With dead ends: 166 [2018-04-10 14:59:44,382 INFO L226 Difference]: Without dead ends: 140 [2018-04-10 14:59:44,382 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-10 14:59:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-10 14:59:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-04-10 14:59:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-10 14:59:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2018-04-10 14:59:44,385 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 109 [2018-04-10 14:59:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:44,385 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2018-04-10 14:59:44,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:59:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2018-04-10 14:59:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-10 14:59:44,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:44,386 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-10 14:59:44,386 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-10 14:59:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash -562399357, now seen corresponding path program 4 times [2018-04-10 14:59:44,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:44,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:44,864 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-10 14:59:44,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:44,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 14:59:44,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:44,866 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-10 14:59:44,866 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-10 14:59:44,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:59:44,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:59:44,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:59:44,866 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand 21 states. [2018-04-10 14:59:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:45,223 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-04-10 14:59:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:59:45,223 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2018-04-10 14:59:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:45,224 INFO L225 Difference]: With dead ends: 136 [2018-04-10 14:59:45,224 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 14:59:45,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:59:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 14:59:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-04-10 14:59:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-10 14:59:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-04-10 14:59:45,226 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 114 [2018-04-10 14:59:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:45,227 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-04-10 14:59:45,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:59:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-04-10 14:59:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-10 14:59:45,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:45,227 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-10 14:59:45,227 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-10 14:59:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -277595443, now seen corresponding path program 1 times [2018-04-10 14:59:45,228 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:45,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:45,284 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-10 14:59:45,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:45,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:59:45,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:59:45,285 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-10 14:59:45,286 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-10 14:59:45,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:59:45,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:59:45,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:59:45,286 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 6 states. [2018-04-10 14:59:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:45,325 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-04-10 14:59:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:59:45,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-04-10 14:59:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:45,326 INFO L225 Difference]: With dead ends: 148 [2018-04-10 14:59:45,326 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 14:59:45,327 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-10 14:59:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 14:59:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-04-10 14:59:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-10 14:59:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-04-10 14:59:45,330 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 122 [2018-04-10 14:59:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:45,332 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-04-10 14:59:45,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:59:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-04-10 14:59:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-10 14:59:45,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:45,333 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-10 14:59:45,333 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-10 14:59:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash 313375475, now seen corresponding path program 2 times [2018-04-10 14:59:45,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:45,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:45,430 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-10 14:59:45,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:45,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 14:59:45,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:45,431 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-10 14:59:45,432 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-10 14:59:45,432 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-10 14:59:45,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:59:45,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:59:45,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:59:45,432 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 7 states. [2018-04-10 14:59:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:45,478 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-04-10 14:59:45,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:59:45,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-04-10 14:59:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:45,480 INFO L225 Difference]: With dead ends: 155 [2018-04-10 14:59:45,480 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 14:59:45,480 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-10 14:59:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 14:59:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-04-10 14:59:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 14:59:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-04-10 14:59:45,485 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 169 [2018-04-10 14:59:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:45,485 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-04-10 14:59:45,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:59:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-04-10 14:59:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-04-10 14:59:45,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:45,486 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-10 14:59:45,486 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-10 14:59:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2136490509, now seen corresponding path program 3 times [2018-04-10 14:59:45,487 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:45,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:45,639 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-10 14:59:45,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:45,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 14:59:45,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:45,640 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-10 14:59:45,641 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-10 14:59:45,641 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-10 14:59:45,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:59:45,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:59:45,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:59:45,642 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 8 states. [2018-04-10 14:59:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:45,719 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-04-10 14:59:45,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:59:45,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-04-10 14:59:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:45,720 INFO L225 Difference]: With dead ends: 162 [2018-04-10 14:59:45,720 INFO L226 Difference]: Without dead ends: 162 [2018-04-10 14:59:45,721 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-10 14:59:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-10 14:59:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2018-04-10 14:59:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 14:59:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-04-10 14:59:45,724 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 216 [2018-04-10 14:59:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:45,725 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-04-10 14:59:45,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:59:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-04-10 14:59:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-04-10 14:59:45,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:45,726 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-10 14:59:45,726 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-10 14:59:45,727 INFO L82 PathProgramCache]: Analyzing trace with hash -882947149, now seen corresponding path program 4 times [2018-04-10 14:59:45,728 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:45,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:45,886 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-10 14:59:45,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:45,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 14:59:45,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:45,887 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-10 14:59:45,887 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-10 14:59:45,887 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-10 14:59:45,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:59:45,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:59:45,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:59:45,887 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 9 states. [2018-04-10 14:59:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:45,945 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-04-10 14:59:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:59:45,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 263 [2018-04-10 14:59:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:45,946 INFO L225 Difference]: With dead ends: 169 [2018-04-10 14:59:45,946 INFO L226 Difference]: Without dead ends: 169 [2018-04-10 14:59:45,947 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-10 14:59:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-10 14:59:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-04-10 14:59:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-10 14:59:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-10 14:59:45,951 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 263 [2018-04-10 14:59:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:45,951 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-10 14:59:45,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:59:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-10 14:59:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-10 14:59:45,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:45,953 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-10 14:59:45,953 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-10 14:59:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 93198669, now seen corresponding path program 5 times [2018-04-10 14:59:45,954 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:45,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:46,151 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-10 14:59:46,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:46,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:59:46,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:46,152 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-10 14:59:46,152 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-10 14:59:46,153 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-10 14:59:46,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:59:46,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:59:46,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:59:46,154 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-04-10 14:59:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:46,223 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-04-10 14:59:46,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:59:46,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 310 [2018-04-10 14:59:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:46,224 INFO L225 Difference]: With dead ends: 176 [2018-04-10 14:59:46,224 INFO L226 Difference]: Without dead ends: 176 [2018-04-10 14:59:46,225 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-10 14:59:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-10 14:59:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-04-10 14:59:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-10 14:59:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-04-10 14:59:46,229 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 310 [2018-04-10 14:59:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:46,230 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-04-10 14:59:46,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:59:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-04-10 14:59:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-10 14:59:46,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:46,232 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-10 14:59:46,232 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-10 14:59:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1457189773, now seen corresponding path program 6 times [2018-04-10 14:59:46,233 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:46,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:46,550 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-10 14:59:46,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:46,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 14:59:46,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:46,551 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-10 14:59:46,551 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-10 14:59:46,552 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-10 14:59:46,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:59:46,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:59:46,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:59:46,553 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 11 states. [2018-04-10 14:59:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:46,606 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-04-10 14:59:46,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:59:46,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2018-04-10 14:59:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:46,608 INFO L225 Difference]: With dead ends: 183 [2018-04-10 14:59:46,608 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 14:59:46,609 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-10 14:59:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 14:59:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2018-04-10 14:59:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-10 14:59:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 189 transitions. [2018-04-10 14:59:46,615 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 189 transitions. Word has length 357 [2018-04-10 14:59:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:46,615 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 189 transitions. [2018-04-10 14:59:46,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:59:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2018-04-10 14:59:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-10 14:59:46,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:46,618 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-10 14:59:46,618 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-10 14:59:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1787412621, now seen corresponding path program 7 times [2018-04-10 14:59:46,619 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:46,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:47,004 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-10 14:59:47,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:47,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:59:47,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:47,006 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-10 14:59:47,006 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-10 14:59:47,007 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-10 14:59:47,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:59:47,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:59:47,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:59:47,007 INFO L87 Difference]: Start difference. First operand 178 states and 189 transitions. Second operand 12 states. [2018-04-10 14:59:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:47,087 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-04-10 14:59:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:59:47,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 404 [2018-04-10 14:59:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:47,089 INFO L225 Difference]: With dead ends: 190 [2018-04-10 14:59:47,089 INFO L226 Difference]: Without dead ends: 190 [2018-04-10 14:59:47,089 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-10 14:59:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-10 14:59:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2018-04-10 14:59:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 14:59:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-04-10 14:59:47,092 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 404 [2018-04-10 14:59:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:47,092 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-04-10 14:59:47,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:59:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-04-10 14:59:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-04-10 14:59:47,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:47,094 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-10 14:59:47,094 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-10 14:59:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 487259443, now seen corresponding path program 8 times [2018-04-10 14:59:47,095 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:47,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:47,470 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-10 14:59:47,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:47,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 14:59:47,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:47,471 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-10 14:59:47,471 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-10 14:59:47,472 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-10 14:59:47,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:59:47,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:59:47,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:59:47,473 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 13 states. [2018-04-10 14:59:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:47,578 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-04-10 14:59:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 14:59:47,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 451 [2018-04-10 14:59:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:47,580 INFO L225 Difference]: With dead ends: 197 [2018-04-10 14:59:47,580 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 14:59:47,580 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-10 14:59:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 14:59:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-04-10 14:59:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 14:59:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-04-10 14:59:47,584 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 451 [2018-04-10 14:59:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:47,585 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-04-10 14:59:47,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:59:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-04-10 14:59:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-04-10 14:59:47,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:47,588 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-10 14:59:47,588 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-10 14:59:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1279313971, now seen corresponding path program 9 times [2018-04-10 14:59:47,589 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:47,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:48,115 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-10 14:59:48,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:48,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 14:59:48,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:48,116 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-10 14:59:48,117 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-10 14:59:48,117 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-10 14:59:48,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:59:48,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:59:48,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:59:48,118 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 14 states. [2018-04-10 14:59:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:48,213 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2018-04-10 14:59:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:59:48,213 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 498 [2018-04-10 14:59:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:48,215 INFO L225 Difference]: With dead ends: 204 [2018-04-10 14:59:48,215 INFO L226 Difference]: Without dead ends: 204 [2018-04-10 14:59:48,215 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-10 14:59:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-10 14:59:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2018-04-10 14:59:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 14:59:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-04-10 14:59:48,221 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 498 [2018-04-10 14:59:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:48,222 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-04-10 14:59:48,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:59:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-04-10 14:59:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-04-10 14:59:48,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:48,228 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-10 14:59:48,228 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-10 14:59:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash -618848781, now seen corresponding path program 10 times [2018-04-10 14:59:48,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:48,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:48,822 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-10 14:59:48,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:48,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 14:59:48,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:48,823 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-10 14:59:48,823 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-10 14:59:48,824 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-10 14:59:48,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:59:48,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:59:48,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:59:48,825 INFO L87 Difference]: Start difference. First operand 199 states and 213 transitions. Second operand 15 states. [2018-04-10 14:59:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:48,899 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-04-10 14:59:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:59:48,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 545 [2018-04-10 14:59:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:48,901 INFO L225 Difference]: With dead ends: 211 [2018-04-10 14:59:48,901 INFO L226 Difference]: Without dead ends: 211 [2018-04-10 14:59:48,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:59:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-10 14:59:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2018-04-10 14:59:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-10 14:59:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2018-04-10 14:59:48,905 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 545 [2018-04-10 14:59:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:48,906 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2018-04-10 14:59:48,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:59:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2018-04-10 14:59:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-10 14:59:48,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:48,910 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-10 14:59:48,910 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-10 14:59:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1134722829, now seen corresponding path program 11 times [2018-04-10 14:59:48,911 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:48,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:49,602 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-10 14:59:49,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:49,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 14:59:49,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:49,604 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-10 14:59:49,604 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-10 14:59:49,604 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-10 14:59:49,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:59:49,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:59:49,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:59:49,605 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand 16 states. [2018-04-10 14:59:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:49,695 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2018-04-10 14:59:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:59:49,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 592 [2018-04-10 14:59:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:49,697 INFO L225 Difference]: With dead ends: 218 [2018-04-10 14:59:49,697 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 14:59:49,698 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-10 14:59:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 14:59:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2018-04-10 14:59:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 14:59:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 229 transitions. [2018-04-10 14:59:49,704 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 229 transitions. Word has length 592 [2018-04-10 14:59:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:49,705 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 229 transitions. [2018-04-10 14:59:49,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:59:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 229 transitions. [2018-04-10 14:59:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-04-10 14:59:49,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:49,710 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-10 14:59:49,710 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-10 14:59:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1704497485, now seen corresponding path program 12 times [2018-04-10 14:59:49,711 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:49,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:50,395 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-10 14:59:50,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:50,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 14:59:50,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:50,396 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-10 14:59:50,396 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-10 14:59:50,396 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-10 14:59:50,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:59:50,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:59:50,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:59:50,396 INFO L87 Difference]: Start difference. First operand 213 states and 229 transitions. Second operand 17 states. [2018-04-10 14:59:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:50,519 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2018-04-10 14:59:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:59:50,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 639 [2018-04-10 14:59:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:50,531 INFO L225 Difference]: With dead ends: 225 [2018-04-10 14:59:50,531 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 14:59:50,531 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:59:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 14:59:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-04-10 14:59:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 14:59:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 237 transitions. [2018-04-10 14:59:50,537 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 237 transitions. Word has length 639 [2018-04-10 14:59:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:50,537 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 237 transitions. [2018-04-10 14:59:50,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:59:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 237 transitions. [2018-04-10 14:59:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2018-04-10 14:59:50,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:50,546 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-10 14:59:50,546 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-10 14:59:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 430413389, now seen corresponding path program 13 times [2018-04-10 14:59:50,547 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:50,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:51,273 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-10 14:59:51,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:51,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:59:51,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:51,274 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-10 14:59:51,274 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-10 14:59:51,275 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-10 14:59:51,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:59:51,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:59:51,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:59:51,275 INFO L87 Difference]: Start difference. First operand 220 states and 237 transitions. Second operand 18 states. [2018-04-10 14:59:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:51,424 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2018-04-10 14:59:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 14:59:51,424 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 686 [2018-04-10 14:59:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:51,425 INFO L225 Difference]: With dead ends: 232 [2018-04-10 14:59:51,425 INFO L226 Difference]: Without dead ends: 232 [2018-04-10 14:59:51,425 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-10 14:59:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-10 14:59:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-04-10 14:59:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-10 14:59:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-04-10 14:59:51,429 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 686 [2018-04-10 14:59:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:51,430 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-04-10 14:59:51,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:59:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-04-10 14:59:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-04-10 14:59:51,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:51,433 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-10 14:59:51,433 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-10 14:59:51,434 INFO L82 PathProgramCache]: Analyzing trace with hash -722079885, now seen corresponding path program 14 times [2018-04-10 14:59:51,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:51,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:52,180 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-10 14:59:52,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:52,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 14:59:52,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:52,181 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-10 14:59:52,182 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-10 14:59:52,182 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-10 14:59:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:59:52,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:59:52,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:59:52,183 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 19 states. [2018-04-10 14:59:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:52,306 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-04-10 14:59:52,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:59:52,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 733 [2018-04-10 14:59:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:52,308 INFO L225 Difference]: With dead ends: 239 [2018-04-10 14:59:52,308 INFO L226 Difference]: Without dead ends: 239 [2018-04-10 14:59:52,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:59:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-10 14:59:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 234. [2018-04-10 14:59:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 14:59:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 253 transitions. [2018-04-10 14:59:52,312 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 253 transitions. Word has length 733 [2018-04-10 14:59:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:52,313 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 253 transitions. [2018-04-10 14:59:52,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:59:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 253 transitions. [2018-04-10 14:59:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-04-10 14:59:52,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:52,318 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-10 14:59:52,318 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-10 14:59:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 306347405, now seen corresponding path program 15 times [2018-04-10 14:59:52,319 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:52,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:53,337 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-10 14:59:53,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:53,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 14:59:53,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4200 trivial. 0 not checked. [2018-04-10 14:59:53,359 INFO L182 omatonBuilderFactory]: Interpolants [11168#(<= main_~i~2 5), 11169#(<= main_~i~2 6), 11170#(<= main_~i~2 7), 11171#(<= main_~i~2 8), 11172#(<= main_~i~2 9), 11173#(<= main_~i~2 10), 11174#(<= main_~i~2 11), 11175#(<= main_~i~2 12), 11176#(<= main_~i~2 13), 11177#(<= main_~i~2 14), 11178#(<= main_~i~2 15), 11179#(<= main_~i~2 16), 11180#(<= main_~i~2 17), 11161#true, 11162#false, 11163#(= main_~i~2 0), 11164#(<= main_~i~2 1), 11165#(<= main_~i~2 2), 11166#(<= main_~i~2 3), 11167#(<= main_~i~2 4)] [2018-04-10 14:59:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10625 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 9639 trivial. 0 not checked. [2018-04-10 14:59:53,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:59:53,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:59:53,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:59:53,360 INFO L87 Difference]: Start difference. First operand 234 states and 253 transitions. Second operand 20 states. [2018-04-10 14:59:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:53,440 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2018-04-10 14:59:53,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:59:53,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 780 [2018-04-10 14:59:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:53,441 INFO L225 Difference]: With dead ends: 246 [2018-04-10 14:59:53,441 INFO L226 Difference]: Without dead ends: 246 [2018-04-10 14:59:53,441 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-10 14:59:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-10 14:59:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-04-10 14:59:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-10 14:59:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 261 transitions. [2018-04-10 14:59:53,444 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 261 transitions. Word has length 780 [2018-04-10 14:59:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:53,445 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 261 transitions. [2018-04-10 14:59:53,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:59:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 261 transitions. [2018-04-10 14:59:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-04-10 14:59:53,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:53,449 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-10 14:59:53,449 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-10 14:59:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2016108493, now seen corresponding path program 16 times [2018-04-10 14:59:53,449 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:53,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:54,340 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-10 14:59:54,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:54,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 14:59:54,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:54,341 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-10 14:59:54,341 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-10 14:59:54,341 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-10 14:59:54,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:59:54,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:59:54,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:59:54,341 INFO L87 Difference]: Start difference. First operand 241 states and 261 transitions. Second operand 21 states. [2018-04-10 14:59:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:54,453 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-04-10 14:59:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 14:59:54,453 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 827 [2018-04-10 14:59:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:54,454 INFO L225 Difference]: With dead ends: 253 [2018-04-10 14:59:54,454 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 14:59:54,455 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:59:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 14:59:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2018-04-10 14:59:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:59:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 269 transitions. [2018-04-10 14:59:54,460 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 269 transitions. Word has length 827 [2018-04-10 14:59:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:54,461 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 269 transitions. [2018-04-10 14:59:54,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:59:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 269 transitions. [2018-04-10 14:59:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-10 14:59:54,467 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:54,468 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-10 14:59:54,468 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-10 14:59:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 652686541, now seen corresponding path program 17 times [2018-04-10 14:59:54,469 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:54,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:55,564 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-10 14:59:55,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:55,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 14:59:55,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:55,565 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-10 14:59:55,565 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-10 14:59:55,565 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-10 14:59:55,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:59:55,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:59:55,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:59:55,566 INFO L87 Difference]: Start difference. First operand 248 states and 269 transitions. Second operand 22 states. [2018-04-10 14:59:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:55,716 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-04-10 14:59:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:59:55,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 874 [2018-04-10 14:59:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:55,718 INFO L225 Difference]: With dead ends: 260 [2018-04-10 14:59:55,718 INFO L226 Difference]: Without dead ends: 260 [2018-04-10 14:59:55,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:59:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-10 14:59:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-04-10 14:59:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-10 14:59:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 277 transitions. [2018-04-10 14:59:55,722 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 277 transitions. Word has length 874 [2018-04-10 14:59:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:55,722 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 277 transitions. [2018-04-10 14:59:55,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:59:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 277 transitions. [2018-04-10 14:59:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2018-04-10 14:59:55,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:55,727 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-10 14:59:55,727 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-10 14:59:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash -217087757, now seen corresponding path program 18 times [2018-04-10 14:59:55,728 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:55,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:57,156 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-10 14:59:57,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:57,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 14:59:57,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:57,158 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-10 14:59:57,158 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-10 14:59:57,158 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-10 14:59:57,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 14:59:57,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 14:59:57,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:59:57,159 INFO L87 Difference]: Start difference. First operand 255 states and 277 transitions. Second operand 23 states. [2018-04-10 14:59:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:57,264 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-04-10 14:59:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 14:59:57,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 921 [2018-04-10 14:59:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:57,266 INFO L225 Difference]: With dead ends: 267 [2018-04-10 14:59:57,266 INFO L226 Difference]: Without dead ends: 267 [2018-04-10 14:59:57,266 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-10 14:59:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-10 14:59:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2018-04-10 14:59:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-10 14:59:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2018-04-10 14:59:57,271 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 921 [2018-04-10 14:59:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:57,271 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2018-04-10 14:59:57,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 14:59:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2018-04-10 14:59:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2018-04-10 14:59:57,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:57,280 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-10 14:59:57,280 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-10 14:59:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1375093747, now seen corresponding path program 19 times [2018-04-10 14:59:57,281 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:57,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:59:58,703 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-10 14:59:58,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:59:58,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 14:59:58,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:59:58,704 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-10 14:59:58,704 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-10 14:59:58,704 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-10 14:59:58,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:59:58,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:59:58,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:59:58,705 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand 24 states. [2018-04-10 14:59:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:59:58,834 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2018-04-10 14:59:58,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:59:58,834 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 968 [2018-04-10 14:59:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:59:58,835 INFO L225 Difference]: With dead ends: 274 [2018-04-10 14:59:58,835 INFO L226 Difference]: Without dead ends: 274 [2018-04-10 14:59:58,835 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-10 14:59:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-10 14:59:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2018-04-10 14:59:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-10 14:59:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 293 transitions. [2018-04-10 14:59:58,838 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 293 transitions. Word has length 968 [2018-04-10 14:59:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:59:58,839 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 293 transitions. [2018-04-10 14:59:58,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:59:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 293 transitions. [2018-04-10 14:59:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2018-04-10 14:59:58,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:59:58,848 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-10 14:59:58,848 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-10 14:59:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1504874931, now seen corresponding path program 20 times [2018-04-10 14:59:58,855 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:59:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:59:58,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:00,309 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-10 15:00:00,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:00,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 15:00:00,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:00,310 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-10 15:00:00,310 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-10 15:00:00,311 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-10 15:00:00,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:00:00,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:00:00,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:00:00,312 INFO L87 Difference]: Start difference. First operand 269 states and 293 transitions. Second operand 25 states. [2018-04-10 15:00:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:00,463 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2018-04-10 15:00:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:00:00,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1015 [2018-04-10 15:00:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:00,464 INFO L225 Difference]: With dead ends: 281 [2018-04-10 15:00:00,465 INFO L226 Difference]: Without dead ends: 281 [2018-04-10 15:00:00,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:00:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-10 15:00:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2018-04-10 15:00:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-10 15:00:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 301 transitions. [2018-04-10 15:00:00,469 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 301 transitions. Word has length 1015 [2018-04-10 15:00:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:00,470 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 301 transitions. [2018-04-10 15:00:00,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:00:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 301 transitions. [2018-04-10 15:00:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-04-10 15:00:00,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:00,475 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-10 15:00:00,475 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-10 15:00:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1692527795, now seen corresponding path program 21 times [2018-04-10 15:00:00,476 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:00,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:02,237 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-10 15:00:02,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:02,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 15:00:02,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:02,238 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-10 15:00:02,238 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-10 15:00:02,239 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-10 15:00:02,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:00:02,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:00:02,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:00:02,239 INFO L87 Difference]: Start difference. First operand 276 states and 301 transitions. Second operand 26 states. [2018-04-10 15:00:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:02,387 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2018-04-10 15:00:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:00:02,387 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1062 [2018-04-10 15:00:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:02,388 INFO L225 Difference]: With dead ends: 288 [2018-04-10 15:00:02,388 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 15:00:02,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:00:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 15:00:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2018-04-10 15:00:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-10 15:00:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 309 transitions. [2018-04-10 15:00:02,393 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 309 transitions. Word has length 1062 [2018-04-10 15:00:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:02,394 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 309 transitions. [2018-04-10 15:00:02,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:00:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 309 transitions. [2018-04-10 15:00:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-04-10 15:00:02,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:02,404 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-10 15:00:02,404 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-10 15:00:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1043737997, now seen corresponding path program 22 times [2018-04-10 15:00:02,405 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:02,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:04,154 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-10 15:00:04,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:04,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:00:04,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:04,155 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-10 15:00:04,155 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-10 15:00:04,155 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-10 15:00:04,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:00:04,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:00:04,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:00:04,156 INFO L87 Difference]: Start difference. First operand 283 states and 309 transitions. Second operand 27 states. [2018-04-10 15:00:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:04,275 INFO L93 Difference]: Finished difference Result 295 states and 323 transitions. [2018-04-10 15:00:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:00:04,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1109 [2018-04-10 15:00:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:04,276 INFO L225 Difference]: With dead ends: 295 [2018-04-10 15:00:04,277 INFO L226 Difference]: Without dead ends: 295 [2018-04-10 15:00:04,277 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-10 15:00:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-10 15:00:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2018-04-10 15:00:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-10 15:00:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 317 transitions. [2018-04-10 15:00:04,281 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 317 transitions. Word has length 1109 [2018-04-10 15:00:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:04,282 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 317 transitions. [2018-04-10 15:00:04,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:00:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 317 transitions. [2018-04-10 15:00:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2018-04-10 15:00:04,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:04,294 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-10 15:00:04,294 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-10 15:00:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1097319795, now seen corresponding path program 23 times [2018-04-10 15:00:04,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:04,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:06,243 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-10 15:00:06,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:06,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 15:00:06,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:06,243 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-10 15:00:06,243 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-10 15:00:06,244 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-10 15:00:06,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:00:06,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:00:06,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:00:06,244 INFO L87 Difference]: Start difference. First operand 290 states and 317 transitions. Second operand 28 states. [2018-04-10 15:00:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:06,435 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2018-04-10 15:00:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:00:06,435 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1156 [2018-04-10 15:00:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:06,436 INFO L225 Difference]: With dead ends: 302 [2018-04-10 15:00:06,436 INFO L226 Difference]: Without dead ends: 302 [2018-04-10 15:00:06,437 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:00:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-10 15:00:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2018-04-10 15:00:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 15:00:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-04-10 15:00:06,441 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 1156 [2018-04-10 15:00:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:06,442 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-04-10 15:00:06,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:00:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-04-10 15:00:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-04-10 15:00:06,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:06,453 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-10 15:00:06,454 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-10 15:00:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1268694221, now seen corresponding path program 24 times [2018-04-10 15:00:06,455 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:06,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:08,742 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-10 15:00:08,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:08,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 15:00:08,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:08,743 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-10 15:00:08,743 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-10 15:00:08,744 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-10 15:00:08,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:00:08,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:00:08,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:00:08,744 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 29 states. [2018-04-10 15:00:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:08,923 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2018-04-10 15:00:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:00:08,923 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1203 [2018-04-10 15:00:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:08,924 INFO L225 Difference]: With dead ends: 309 [2018-04-10 15:00:08,924 INFO L226 Difference]: Without dead ends: 309 [2018-04-10 15:00:08,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:00:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-10 15:00:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2018-04-10 15:00:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-10 15:00:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 333 transitions. [2018-04-10 15:00:08,928 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 333 transitions. Word has length 1203 [2018-04-10 15:00:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:08,928 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 333 transitions. [2018-04-10 15:00:08,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:00:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 333 transitions. [2018-04-10 15:00:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2018-04-10 15:00:08,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:08,935 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-10 15:00:08,935 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-10 15:00:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash 99365325, now seen corresponding path program 25 times [2018-04-10 15:00:08,936 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:09,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:11,279 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-10 15:00:11,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:11,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 15:00:11,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:11,280 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-10 15:00:11,280 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-10 15:00:11,280 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-10 15:00:11,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:00:11,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:00:11,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:00:11,281 INFO L87 Difference]: Start difference. First operand 304 states and 333 transitions. Second operand 30 states. [2018-04-10 15:00:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:11,469 INFO L93 Difference]: Finished difference Result 316 states and 347 transitions. [2018-04-10 15:00:11,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:00:11,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1250 [2018-04-10 15:00:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:11,470 INFO L225 Difference]: With dead ends: 316 [2018-04-10 15:00:11,470 INFO L226 Difference]: Without dead ends: 316 [2018-04-10 15:00:11,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:00:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-10 15:00:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2018-04-10 15:00:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-10 15:00:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-04-10 15:00:11,473 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 1250 [2018-04-10 15:00:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:11,474 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-04-10 15:00:11,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:00:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-04-10 15:00:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2018-04-10 15:00:11,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:11,481 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-10 15:00:11,481 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-10 15:00:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash -41622541, now seen corresponding path program 26 times [2018-04-10 15:00:11,482 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:11,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:14,152 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-10 15:00:14,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:14,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 15:00:14,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:14,153 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-10 15:00:14,153 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-10 15:00:14,153 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-10 15:00:14,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 15:00:14,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 15:00:14,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:00:14,154 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 31 states. [2018-04-10 15:00:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:14,367 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-04-10 15:00:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:00:14,367 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1297 [2018-04-10 15:00:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:14,368 INFO L225 Difference]: With dead ends: 323 [2018-04-10 15:00:14,368 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 15:00:14,369 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-10 15:00:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 15:00:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2018-04-10 15:00:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 15:00:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 349 transitions. [2018-04-10 15:00:14,372 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 349 transitions. Word has length 1297 [2018-04-10 15:00:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:14,372 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 349 transitions. [2018-04-10 15:00:14,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 15:00:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 349 transitions. [2018-04-10 15:00:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1345 [2018-04-10 15:00:14,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:14,380 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-10 15:00:14,380 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-10 15:00:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1148323571, now seen corresponding path program 27 times [2018-04-10 15:00:14,381 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:14,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:17,163 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-10 15:00:17,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:17,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 15:00:17,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:17,164 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-10 15:00:17,164 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-10 15:00:17,164 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-10 15:00:17,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 15:00:17,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 15:00:17,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:00:17,165 INFO L87 Difference]: Start difference. First operand 318 states and 349 transitions. Second operand 32 states. [2018-04-10 15:00:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:17,432 INFO L93 Difference]: Finished difference Result 330 states and 363 transitions. [2018-04-10 15:00:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 15:00:17,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1344 [2018-04-10 15:00:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:17,434 INFO L225 Difference]: With dead ends: 330 [2018-04-10 15:00:17,434 INFO L226 Difference]: Without dead ends: 330 [2018-04-10 15:00:17,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:00:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-10 15:00:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2018-04-10 15:00:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-10 15:00:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 357 transitions. [2018-04-10 15:00:17,438 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 357 transitions. Word has length 1344 [2018-04-10 15:00:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:17,439 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 357 transitions. [2018-04-10 15:00:17,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 15:00:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 357 transitions. [2018-04-10 15:00:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1392 [2018-04-10 15:00:17,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:17,448 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-10 15:00:17,448 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-10 15:00:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1816179891, now seen corresponding path program 28 times [2018-04-10 15:00:17,449 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:17,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:20,539 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-10 15:00:20,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:20,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-10 15:00:20,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:20,540 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-10 15:00:20,540 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-10 15:00:20,541 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-10 15:00:20,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 15:00:20,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 15:00:20,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:00:20,542 INFO L87 Difference]: Start difference. First operand 325 states and 357 transitions. Second operand 33 states. [2018-04-10 15:00:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:20,726 INFO L93 Difference]: Finished difference Result 337 states and 371 transitions. [2018-04-10 15:00:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:00:20,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1391 [2018-04-10 15:00:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:20,728 INFO L225 Difference]: With dead ends: 337 [2018-04-10 15:00:20,728 INFO L226 Difference]: Without dead ends: 337 [2018-04-10 15:00:20,728 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-10 15:00:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-10 15:00:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 332. [2018-04-10 15:00:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-04-10 15:00:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 365 transitions. [2018-04-10 15:00:20,733 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 365 transitions. Word has length 1391 [2018-04-10 15:00:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:20,734 INFO L459 AbstractCegarLoop]: Abstraction has 332 states and 365 transitions. [2018-04-10 15:00:20,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 15:00:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 365 transitions. [2018-04-10 15:00:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1439 [2018-04-10 15:00:20,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:20,749 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-10 15:00:20,749 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-10 15:00:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -957247411, now seen corresponding path program 29 times [2018-04-10 15:00:20,750 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:20,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:24,084 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-10 15:00:24,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:24,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 15:00:24,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:24,084 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-10 15:00:24,085 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-10 15:00:24,085 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-10 15:00:24,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 15:00:24,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 15:00:24,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 15:00:24,086 INFO L87 Difference]: Start difference. First operand 332 states and 365 transitions. Second operand 34 states. [2018-04-10 15:00:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:24,267 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-04-10 15:00:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:00:24,267 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1438 [2018-04-10 15:00:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:24,269 INFO L225 Difference]: With dead ends: 344 [2018-04-10 15:00:24,269 INFO L226 Difference]: Without dead ends: 344 [2018-04-10 15:00:24,269 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-10 15:00:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-10 15:00:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2018-04-10 15:00:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-10 15:00:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 373 transitions. [2018-04-10 15:00:24,272 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 373 transitions. Word has length 1438 [2018-04-10 15:00:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:24,273 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 373 transitions. [2018-04-10 15:00:24,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 15:00:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 373 transitions. [2018-04-10 15:00:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-04-10 15:00:24,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:24,282 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-10 15:00:24,283 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-10 15:00:24,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1834961549, now seen corresponding path program 30 times [2018-04-10 15:00:24,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:24,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:28,085 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-10 15:00:28,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:28,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-10 15:00:28,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:28,087 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-10 15:00:28,087 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-10 15:00:28,087 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-10 15:00:28,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:00:28,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:00:28,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:00:28,088 INFO L87 Difference]: Start difference. First operand 339 states and 373 transitions. Second operand 35 states. [2018-04-10 15:00:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:28,277 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-04-10 15:00:28,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:00:28,277 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1485 [2018-04-10 15:00:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:28,279 INFO L225 Difference]: With dead ends: 351 [2018-04-10 15:00:28,279 INFO L226 Difference]: Without dead ends: 351 [2018-04-10 15:00:28,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:00:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-10 15:00:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2018-04-10 15:00:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-10 15:00:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 381 transitions. [2018-04-10 15:00:28,282 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 381 transitions. Word has length 1485 [2018-04-10 15:00:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:28,283 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 381 transitions. [2018-04-10 15:00:28,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:00:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 381 transitions. [2018-04-10 15:00:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-04-10 15:00:28,292 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:28,293 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-10 15:00:28,293 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-10 15:00:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash -326436979, now seen corresponding path program 31 times [2018-04-10 15:00:28,294 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:28,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:32,320 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-10 15:00:32,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:32,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 15:00:32,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:32,321 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-10 15:00:32,321 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-10 15:00:32,322 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-10 15:00:32,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 15:00:32,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 15:00:32,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:00:32,322 INFO L87 Difference]: Start difference. First operand 346 states and 381 transitions. Second operand 36 states. [2018-04-10 15:00:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:32,637 INFO L93 Difference]: Finished difference Result 358 states and 395 transitions. [2018-04-10 15:00:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:00:32,637 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1532 [2018-04-10 15:00:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:32,639 INFO L225 Difference]: With dead ends: 358 [2018-04-10 15:00:32,639 INFO L226 Difference]: Without dead ends: 358 [2018-04-10 15:00:32,639 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-10 15:00:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-10 15:00:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2018-04-10 15:00:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-10 15:00:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 389 transitions. [2018-04-10 15:00:32,642 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 389 transitions. Word has length 1532 [2018-04-10 15:00:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:32,643 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 389 transitions. [2018-04-10 15:00:32,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 15:00:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 389 transitions. [2018-04-10 15:00:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2018-04-10 15:00:32,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:32,653 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-10 15:00:32,653 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-10 15:00:32,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2052004301, now seen corresponding path program 32 times [2018-04-10 15:00:32,654 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:32,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:36,975 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-10 15:00:36,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:36,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-10 15:00:36,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:36,977 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-10 15:00:36,977 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-10 15:00:36,977 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-10 15:00:36,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:00:36,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:00:36,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:00:36,978 INFO L87 Difference]: Start difference. First operand 353 states and 389 transitions. Second operand 37 states. [2018-04-10 15:00:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:37,241 INFO L93 Difference]: Finished difference Result 365 states and 403 transitions. [2018-04-10 15:00:37,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:00:37,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1579 [2018-04-10 15:00:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:37,242 INFO L225 Difference]: With dead ends: 365 [2018-04-10 15:00:37,242 INFO L226 Difference]: Without dead ends: 365 [2018-04-10 15:00:37,242 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-10 15:00:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-10 15:00:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 360. [2018-04-10 15:00:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-10 15:00:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 397 transitions. [2018-04-10 15:00:37,245 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 397 transitions. Word has length 1579 [2018-04-10 15:00:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:37,246 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 397 transitions. [2018-04-10 15:00:37,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:00:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 397 transitions. [2018-04-10 15:00:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1627 [2018-04-10 15:00:37,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:37,257 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-10 15:00:37,257 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-10 15:00:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash 231616205, now seen corresponding path program 33 times [2018-04-10 15:00:37,257 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:37,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:41,902 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-10 15:00:41,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:41,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 15:00:41,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:41,903 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-10 15:00:41,903 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-10 15:00:41,904 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-10 15:00:41,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 15:00:41,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 15:00:41,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:00:41,905 INFO L87 Difference]: Start difference. First operand 360 states and 397 transitions. Second operand 38 states. [2018-04-10 15:00:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:42,113 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2018-04-10 15:00:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 15:00:42,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1626 [2018-04-10 15:00:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:42,115 INFO L225 Difference]: With dead ends: 372 [2018-04-10 15:00:42,115 INFO L226 Difference]: Without dead ends: 372 [2018-04-10 15:00:42,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:00:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-10 15:00:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2018-04-10 15:00:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-10 15:00:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2018-04-10 15:00:42,119 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 1626 [2018-04-10 15:00:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:42,119 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2018-04-10 15:00:42,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 15:00:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2018-04-10 15:00:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1674 [2018-04-10 15:00:42,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:42,131 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-10 15:00:42,131 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-10 15:00:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1652734221, now seen corresponding path program 34 times [2018-04-10 15:00:42,132 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:42,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:47,162 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-10 15:00:47,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:47,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-10 15:00:47,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:47,163 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-10 15:00:47,163 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-10 15:00:47,164 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-10 15:00:47,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 15:00:47,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 15:00:47,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:00:47,164 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand 39 states. [2018-04-10 15:00:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:47,448 INFO L93 Difference]: Finished difference Result 379 states and 419 transitions. [2018-04-10 15:00:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 15:00:47,448 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1673 [2018-04-10 15:00:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:47,450 INFO L225 Difference]: With dead ends: 379 [2018-04-10 15:00:47,451 INFO L226 Difference]: Without dead ends: 379 [2018-04-10 15:00:47,451 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-10 15:00:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-10 15:00:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 374. [2018-04-10 15:00:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-10 15:00:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 413 transitions. [2018-04-10 15:00:47,455 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 413 transitions. Word has length 1673 [2018-04-10 15:00:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:47,455 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 413 transitions. [2018-04-10 15:00:47,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 15:00:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 413 transitions. [2018-04-10 15:00:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2018-04-10 15:00:47,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:47,468 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-10 15:00:47,468 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-10 15:00:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1764701709, now seen corresponding path program 35 times [2018-04-10 15:00:47,469 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:47,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:52,894 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-10 15:00:52,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:52,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 15:00:52,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:52,895 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-10 15:00:52,895 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-10 15:00:52,896 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-10 15:00:52,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 15:00:52,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 15:00:52,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:00:52,896 INFO L87 Difference]: Start difference. First operand 374 states and 413 transitions. Second operand 40 states. [2018-04-10 15:00:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:53,200 INFO L93 Difference]: Finished difference Result 386 states and 427 transitions. [2018-04-10 15:00:53,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:00:53,201 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1720 [2018-04-10 15:00:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:53,203 INFO L225 Difference]: With dead ends: 386 [2018-04-10 15:00:53,203 INFO L226 Difference]: Without dead ends: 386 [2018-04-10 15:00:53,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:00:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-10 15:00:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2018-04-10 15:00:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-10 15:00:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 421 transitions. [2018-04-10 15:00:53,206 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 421 transitions. Word has length 1720 [2018-04-10 15:00:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:53,207 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 421 transitions. [2018-04-10 15:00:53,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 15:00:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 421 transitions. [2018-04-10 15:00:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2018-04-10 15:00:53,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:53,220 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-10 15:00:53,220 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-10 15:00:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash 890361779, now seen corresponding path program 36 times [2018-04-10 15:00:53,221 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:53,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:00:59,004 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-10 15:00:59,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:00:59,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-10 15:00:59,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:00:59,005 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-10 15:00:59,005 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-10 15:00:59,006 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-10 15:00:59,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:00:59,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:00:59,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:00:59,006 INFO L87 Difference]: Start difference. First operand 381 states and 421 transitions. Second operand 41 states. [2018-04-10 15:00:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:00:59,350 INFO L93 Difference]: Finished difference Result 393 states and 435 transitions. [2018-04-10 15:00:59,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 15:00:59,350 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1767 [2018-04-10 15:00:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:00:59,352 INFO L225 Difference]: With dead ends: 393 [2018-04-10 15:00:59,352 INFO L226 Difference]: Without dead ends: 393 [2018-04-10 15:00:59,352 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-10 15:00:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-10 15:00:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-04-10 15:00:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-10 15:00:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 429 transitions. [2018-04-10 15:00:59,355 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 429 transitions. Word has length 1767 [2018-04-10 15:00:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:00:59,356 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 429 transitions. [2018-04-10 15:00:59,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:00:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 429 transitions. [2018-04-10 15:00:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1815 [2018-04-10 15:00:59,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:00:59,369 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-10 15:00:59,369 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-10 15:00:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash -635302579, now seen corresponding path program 37 times [2018-04-10 15:00:59,370 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:00:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:00:59,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:05,707 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-10 15:01:05,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:05,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 15:01:05,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:05,708 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-10 15:01:05,708 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-10 15:01:05,709 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-10 15:01:05,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 15:01:05,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 15:01:05,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:01:05,710 INFO L87 Difference]: Start difference. First operand 388 states and 429 transitions. Second operand 42 states. [2018-04-10 15:01:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:05,962 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2018-04-10 15:01:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 15:01:05,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1814 [2018-04-10 15:01:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:05,964 INFO L225 Difference]: With dead ends: 400 [2018-04-10 15:01:05,964 INFO L226 Difference]: Without dead ends: 400 [2018-04-10 15:01:05,964 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-10 15:01:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-04-10 15:01:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 395. [2018-04-10 15:01:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-10 15:01:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 437 transitions. [2018-04-10 15:01:05,967 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 437 transitions. Word has length 1814 [2018-04-10 15:01:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:05,968 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 437 transitions. [2018-04-10 15:01:05,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 15:01:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 437 transitions. [2018-04-10 15:01:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1862 [2018-04-10 15:01:05,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:05,982 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-10 15:01:05,983 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-10 15:01:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1786419315, now seen corresponding path program 38 times [2018-04-10 15:01:05,983 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:06,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:12,656 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-10 15:01:12,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:12,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-10 15:01:12,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:12,657 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-10 15:01:12,657 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-10 15:01:12,658 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-10 15:01:12,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 15:01:12,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 15:01:12,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:01:12,658 INFO L87 Difference]: Start difference. First operand 395 states and 437 transitions. Second operand 43 states. [2018-04-10 15:01:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:13,010 INFO L93 Difference]: Finished difference Result 407 states and 451 transitions. [2018-04-10 15:01:13,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 15:01:13,010 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1861 [2018-04-10 15:01:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:13,012 INFO L225 Difference]: With dead ends: 407 [2018-04-10 15:01:13,012 INFO L226 Difference]: Without dead ends: 407 [2018-04-10 15:01:13,012 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-10 15:01:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-10 15:01:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 402. [2018-04-10 15:01:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-10 15:01:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 445 transitions. [2018-04-10 15:01:13,015 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 445 transitions. Word has length 1861 [2018-04-10 15:01:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:13,016 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 445 transitions. [2018-04-10 15:01:13,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 15:01:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 445 transitions. [2018-04-10 15:01:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1909 [2018-04-10 15:01:13,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:13,031 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-10 15:01:13,031 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-10 15:01:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash 421180557, now seen corresponding path program 39 times [2018-04-10 15:01:13,031 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:13,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:20,232 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-10 15:01:20,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:20,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-10 15:01:20,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:20,234 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-10 15:01:20,234 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-10 15:01:20,235 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-10 15:01:20,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 15:01:20,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 15:01:20,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:01:20,236 INFO L87 Difference]: Start difference. First operand 402 states and 445 transitions. Second operand 44 states. [2018-04-10 15:01:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:20,616 INFO L93 Difference]: Finished difference Result 414 states and 459 transitions. [2018-04-10 15:01:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 15:01:20,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1908 [2018-04-10 15:01:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:20,618 INFO L225 Difference]: With dead ends: 414 [2018-04-10 15:01:20,618 INFO L226 Difference]: Without dead ends: 414 [2018-04-10 15:01:20,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:01:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-10 15:01:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 409. [2018-04-10 15:01:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-10 15:01:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 453 transitions. [2018-04-10 15:01:20,622 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 453 transitions. Word has length 1908 [2018-04-10 15:01:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:20,622 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 453 transitions. [2018-04-10 15:01:20,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 15:01:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 453 transitions. [2018-04-10 15:01:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-04-10 15:01:20,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:20,642 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-10 15:01:20,642 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-10 15:01:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash -557610701, now seen corresponding path program 40 times [2018-04-10 15:01:20,643 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:20,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:28,312 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-10 15:01:28,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:28,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-10 15:01:28,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:28,313 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-10 15:01:28,313 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-10 15:01:28,314 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-10 15:01:28,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 15:01:28,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 15:01:28,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:01:28,315 INFO L87 Difference]: Start difference. First operand 409 states and 453 transitions. Second operand 45 states. [2018-04-10 15:01:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:28,578 INFO L93 Difference]: Finished difference Result 421 states and 467 transitions. [2018-04-10 15:01:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 15:01:28,578 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1955 [2018-04-10 15:01:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:28,580 INFO L225 Difference]: With dead ends: 421 [2018-04-10 15:01:28,580 INFO L226 Difference]: Without dead ends: 421 [2018-04-10 15:01:28,581 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-10 15:01:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-10 15:01:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 416. [2018-04-10 15:01:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-04-10 15:01:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 461 transitions. [2018-04-10 15:01:28,584 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 461 transitions. Word has length 1955 [2018-04-10 15:01:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:28,585 INFO L459 AbstractCegarLoop]: Abstraction has 416 states and 461 transitions. [2018-04-10 15:01:28,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 15:01:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 461 transitions. [2018-04-10 15:01:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2003 [2018-04-10 15:01:28,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:28,601 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-10 15:01:28,601 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-10 15:01:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -74634291, now seen corresponding path program 41 times [2018-04-10 15:01:28,602 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:28,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:36,778 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-10 15:01:36,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:36,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 15:01:36,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:36,780 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-10 15:01:36,780 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-10 15:01:36,782 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-10 15:01:36,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 15:01:36,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 15:01:36,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:01:36,783 INFO L87 Difference]: Start difference. First operand 416 states and 461 transitions. Second operand 46 states. [2018-04-10 15:01:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:37,054 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2018-04-10 15:01:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 15:01:37,055 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2002 [2018-04-10 15:01:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:37,056 INFO L225 Difference]: With dead ends: 428 [2018-04-10 15:01:37,056 INFO L226 Difference]: Without dead ends: 428 [2018-04-10 15:01:37,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:01:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-10 15:01:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 423. [2018-04-10 15:01:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-10 15:01:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 469 transitions. [2018-04-10 15:01:37,061 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 469 transitions. Word has length 2002 [2018-04-10 15:01:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:37,063 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 469 transitions. [2018-04-10 15:01:37,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 15:01:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 469 transitions. [2018-04-10 15:01:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2050 [2018-04-10 15:01:37,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:37,080 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-10 15:01:37,080 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-10 15:01:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1979230707, now seen corresponding path program 42 times [2018-04-10 15:01:37,081 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:37,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:45,661 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-10 15:01:45,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:45,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-10 15:01:45,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:45,663 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-10 15:01:45,663 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-10 15:01:45,664 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-10 15:01:45,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:01:45,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:01:45,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:01:45,665 INFO L87 Difference]: Start difference. First operand 423 states and 469 transitions. Second operand 47 states. [2018-04-10 15:01:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:46,016 INFO L93 Difference]: Finished difference Result 435 states and 483 transitions. [2018-04-10 15:01:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 15:01:46,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2049 [2018-04-10 15:01:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:46,018 INFO L225 Difference]: With dead ends: 435 [2018-04-10 15:01:46,018 INFO L226 Difference]: Without dead ends: 435 [2018-04-10 15:01:46,019 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-10 15:01:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-10 15:01:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 430. [2018-04-10 15:01:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-04-10 15:01:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2018-04-10 15:01:46,022 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 2049 [2018-04-10 15:01:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:46,023 INFO L459 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2018-04-10 15:01:46,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:01:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2018-04-10 15:01:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2097 [2018-04-10 15:01:46,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:46,041 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-10 15:01:46,041 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-10 15:01:46,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1276284147, now seen corresponding path program 43 times [2018-04-10 15:01:46,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:46,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:01:55,560 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-10 15:01:55,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:01:55,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 15:01:55,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:01:55,561 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-10 15:01:55,561 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-10 15:01:55,562 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-10 15:01:55,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 15:01:55,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 15:01:55,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 15:01:55,563 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand 48 states. [2018-04-10 15:01:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:01:55,902 INFO L93 Difference]: Finished difference Result 442 states and 491 transitions. [2018-04-10 15:01:55,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 15:01:55,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2096 [2018-04-10 15:01:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:01:55,905 INFO L225 Difference]: With dead ends: 442 [2018-04-10 15:01:55,905 INFO L226 Difference]: Without dead ends: 442 [2018-04-10 15:01:55,905 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-10 15:01:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-10 15:01:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 437. [2018-04-10 15:01:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-10 15:01:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 485 transitions. [2018-04-10 15:01:55,909 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 485 transitions. Word has length 2096 [2018-04-10 15:01:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:01:55,910 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 485 transitions. [2018-04-10 15:01:55,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 15:01:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 485 transitions. [2018-04-10 15:01:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2144 [2018-04-10 15:01:55,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:01:55,929 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-10 15:01:55,929 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-10 15:01:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash 388364979, now seen corresponding path program 44 times [2018-04-10 15:01:55,930 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:01:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:01:56,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:02:05,885 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-10 15:02:05,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:02:05,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-10 15:02:05,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:02:05,886 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-10 15:02:05,886 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-10 15:02:05,887 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-10 15:02:05,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:02:05,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:02:05,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:02:05,888 INFO L87 Difference]: Start difference. First operand 437 states and 485 transitions. Second operand 49 states. [2018-04-10 15:02:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:02:06,319 INFO L93 Difference]: Finished difference Result 449 states and 499 transitions. [2018-04-10 15:02:06,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 15:02:06,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2143 [2018-04-10 15:02:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:02:06,321 INFO L225 Difference]: With dead ends: 449 [2018-04-10 15:02:06,321 INFO L226 Difference]: Without dead ends: 449 [2018-04-10 15:02:06,322 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-10 15:02:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-10 15:02:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 444. [2018-04-10 15:02:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-10 15:02:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 493 transitions. [2018-04-10 15:02:06,325 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 493 transitions. Word has length 2143 [2018-04-10 15:02:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:02:06,326 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 493 transitions. [2018-04-10 15:02:06,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:02:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 493 transitions. [2018-04-10 15:02:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2191 [2018-04-10 15:02:06,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:02:06,345 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-10 15:02:06,345 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-10 15:02:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 296716877, now seen corresponding path program 45 times [2018-04-10 15:02:06,346 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:02:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:02:06,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:02:16,959 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-10 15:02:16,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:02:16,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 15:02:16,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:02:16,960 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-10 15:02:16,960 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-10 15:02:16,961 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-10 15:02:16,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 15:02:16,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 15:02:16,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:02:16,962 INFO L87 Difference]: Start difference. First operand 444 states and 493 transitions. Second operand 50 states. [2018-04-10 15:02:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:02:17,450 INFO L93 Difference]: Finished difference Result 456 states and 507 transitions. [2018-04-10 15:02:17,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 15:02:17,450 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2190 [2018-04-10 15:02:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:02:17,453 INFO L225 Difference]: With dead ends: 456 [2018-04-10 15:02:17,454 INFO L226 Difference]: Without dead ends: 456 [2018-04-10 15:02:17,454 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-10 15:02:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-10 15:02:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 451. [2018-04-10 15:02:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-04-10 15:02:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 501 transitions. [2018-04-10 15:02:17,458 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 501 transitions. Word has length 2190 [2018-04-10 15:02:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:02:17,459 INFO L459 AbstractCegarLoop]: Abstraction has 451 states and 501 transitions. [2018-04-10 15:02:17,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 15:02:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 501 transitions. [2018-04-10 15:02:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2238 [2018-04-10 15:02:17,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:02:17,479 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-10 15:02:17,479 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-10 15:02:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1817672563, now seen corresponding path program 46 times [2018-04-10 15:02:17,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:02:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:02:17,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:02:28,883 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-10 15:02:28,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:02:28,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-10 15:02:28,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:02:28,906 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-10 15:02:28,906 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-10 15:02:28,907 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-10 15:02:28,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 15:02:28,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 15:02:28,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:02:28,908 INFO L87 Difference]: Start difference. First operand 451 states and 501 transitions. Second operand 51 states. [2018-04-10 15:02:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:02:29,420 INFO L93 Difference]: Finished difference Result 463 states and 515 transitions. [2018-04-10 15:02:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 15:02:29,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2237 [2018-04-10 15:02:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:02:29,422 INFO L225 Difference]: With dead ends: 463 [2018-04-10 15:02:29,422 INFO L226 Difference]: Without dead ends: 463 [2018-04-10 15:02:29,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:02:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-10 15:02:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2018-04-10 15:02:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-10 15:02:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 509 transitions. [2018-04-10 15:02:29,427 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 509 transitions. Word has length 2237 [2018-04-10 15:02:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:02:29,428 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 509 transitions. [2018-04-10 15:02:29,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 15:02:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 509 transitions. [2018-04-10 15:02:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2285 [2018-04-10 15:02:29,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:02:29,448 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-10 15:02:29,449 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-10 15:02:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1052282483, now seen corresponding path program 47 times [2018-04-10 15:02:29,449 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:02:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:02:29,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:02:41,116 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-10 15:02:41,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:02:41,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-10 15:02:41,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:02:41,117 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-10 15:02:41,117 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-10 15:02:41,119 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-10 15:02:41,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 15:02:41,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 15:02:41,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 15:02:41,119 INFO L87 Difference]: Start difference. First operand 458 states and 509 transitions. Second operand 52 states. [2018-04-10 15:02:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:02:41,606 INFO L93 Difference]: Finished difference Result 470 states and 523 transitions. [2018-04-10 15:02:41,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 15:02:41,606 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2284 [2018-04-10 15:02:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:02:41,608 INFO L225 Difference]: With dead ends: 470 [2018-04-10 15:02:41,608 INFO L226 Difference]: Without dead ends: 470 [2018-04-10 15:02:41,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 15:02:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-10 15:02:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 465. [2018-04-10 15:02:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-10 15:02:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 517 transitions. [2018-04-10 15:02:41,612 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 517 transitions. Word has length 2284 [2018-04-10 15:02:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:02:41,613 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 517 transitions. [2018-04-10 15:02:41,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 15:02:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 517 transitions. [2018-04-10 15:02:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-04-10 15:02:41,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:02:41,634 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-10 15:02:41,634 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-10 15:02:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1567019981, now seen corresponding path program 48 times [2018-04-10 15:02:41,635 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:02:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:02:41,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-10 15:02:41,989 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 15:02:41,992 INFO L168 Benchmark]: Toolchain (without parser) took 183219.04 ms. Allocated memory was 407.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 348.3 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 622.9 MB. Max. memory is 5.3 GB. [2018-04-10 15:02:41,993 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 407.4 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:02:41,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.12 ms. Allocated memory is still 407.4 MB. Free memory was 348.3 MB in the beginning and 337.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-10 15:02:41,994 INFO L168 Benchmark]: Boogie Preprocessor took 26.82 ms. Allocated memory is still 407.4 MB. Free memory is still 337.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:02:41,994 INFO L168 Benchmark]: RCFGBuilder took 271.02 ms. Allocated memory was 407.4 MB in the beginning and 622.9 MB in the end (delta: 215.5 MB). Free memory was 337.7 MB in the beginning and 582.2 MB in the end (delta: -244.5 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 15:02:41,994 INFO L168 Benchmark]: TraceAbstraction took 182762.48 ms. Allocated memory was 622.9 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 582.2 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 641.4 MB. Max. memory is 5.3 GB. [2018-04-10 15:02:41,996 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 407.4 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.12 ms. Allocated memory is still 407.4 MB. Free memory was 348.3 MB in the beginning and 337.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.82 ms. Allocated memory is still 407.4 MB. Free memory is still 337.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 271.02 ms. Allocated memory was 407.4 MB in the beginning and 622.9 MB in the end (delta: 215.5 MB). Free memory was 337.7 MB in the beginning and 582.2 MB in the end (delta: -244.5 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 182762.48 ms. Allocated memory was 622.9 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 582.2 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 641.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-02-42-003.csv Completed graceful shutdown