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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:14:11,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:14:11,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:14:11,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:14:11,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:14:11,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:14:11,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:14:11,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:14:11,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:14:11,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:14:11,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:14:11,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:14:11,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:14:11,701 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:14:11,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:14:11,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:14:11,704 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:14:11,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:14:11,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:14:11,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:14:11,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:14:11,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:14:11,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:14:11,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:14:11,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:14:11,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:14:11,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:14:11,710 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:14:11,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:14:11,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:14:11,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:14:11,711 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_NoArray.epf [2018-04-10 16:14:11,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:14:11,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:14:11,731 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:14:11,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:14:11,731 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:14:11,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:14:11,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:14:11,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:14:11,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:14:11,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:14:11,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:14:11,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:14:11,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:14:11,733 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:14:11,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:14:11,733 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:14:11,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:14:11,768 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:14:11,771 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:14:11,772 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:14:11,772 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:14:11,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-10 16:14:12,048 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc5142410e [2018-04-10 16:14:12,160 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:14:12,161 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:14:12,161 INFO L168 CDTParser]: Scanning ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-10 16:14:12,162 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:14:12,162 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:14:12,162 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:14:12,162 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-10 16:14:12,162 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-10 16:14:12,162 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:14:12,162 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:14:12,174 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc5142410e [2018-04-10 16:14:12,177 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:14:12,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:14:12,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:14:12,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:14:12,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:14:12,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182d2445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12, skipping insertion in model container [2018-04-10 16:14:12,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,202 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:14:12,210 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:14:12,327 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:14:12,347 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:14:12,352 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 16:14:12,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12 WrapperNode [2018-04-10 16:14:12,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:14:12,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:14:12,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:14:12,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:14:12,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (1/1) ... [2018-04-10 16:14:12,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:14:12,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:14:12,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:14:12,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:14:12,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (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 16:14:12,423 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:14:12,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:14:12,424 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-10 16:14:12,424 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:14:12,424 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:14:12,612 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:14:12,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:14:12 BoogieIcfgContainer [2018-04-10 16:14:12,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:14:12,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:14:12,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:14:12,615 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:14:12,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:14:12" (1/3) ... [2018-04-10 16:14:12,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ec84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:14:12, skipping insertion in model container [2018-04-10 16:14:12,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:12" (2/3) ... [2018-04-10 16:14:12,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ec84fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:14:12, skipping insertion in model container [2018-04-10 16:14:12,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:14:12" (3/3) ... [2018-04-10 16:14:12,617 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-04-10 16:14:12,622 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:14:12,628 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 16:14:12,658 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:14:12,659 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:14:12,659 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:14:12,659 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:14:12,659 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:14:12,659 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:14:12,659 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:14:12,659 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:14:12,660 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:14:12,660 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:14:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-10 16:14:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-10 16:14:12,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:12,675 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:12,675 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-04-10 16:14:12,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:12,679 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:12,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:12,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:12,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:12,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:12,790 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 16:14:12,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:12,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:14:12,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:14:12,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:14:12,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:12,804 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-10 16:14:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:12,860 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-10 16:14:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:14:12,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-10 16:14:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:12,867 INFO L225 Difference]: With dead ends: 63 [2018-04-10 16:14:12,867 INFO L226 Difference]: Without dead ends: 59 [2018-04-10 16:14:12,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-10 16:14:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-10 16:14:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 16:14:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-10 16:14:12,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-10 16:14:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:12,899 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-10 16:14:12,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:14:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-10 16:14:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:14:12,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:12,900 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:12,900 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-04-10 16:14:12,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:12,900 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:12,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:12,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:12,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:12,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:12,972 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 16:14:12,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:12,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:14:12,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:12,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:12,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:12,975 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-04-10 16:14:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:13,089 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-04-10 16:14:13,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:13,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 16:14:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:13,090 INFO L225 Difference]: With dead ends: 65 [2018-04-10 16:14:13,090 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:14:13,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:14:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-04-10 16:14:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-10 16:14:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-04-10 16:14:13,097 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-04-10 16:14:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:13,097 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-04-10 16:14:13,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-04-10 16:14:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 16:14:13,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:13,098 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:13,099 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-04-10 16:14:13,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:13,099 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:13,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:14:13,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:13,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:14:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:13,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:13,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:13,149 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-04-10 16:14:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:13,199 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-04-10 16:14:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:13,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-10 16:14:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:13,200 INFO L225 Difference]: With dead ends: 65 [2018-04-10 16:14:13,200 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:14:13,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:14:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-04-10 16:14:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-10 16:14:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-04-10 16:14:13,204 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-04-10 16:14:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:13,205 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-04-10 16:14:13,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-04-10 16:14:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:14:13,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:13,205 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:13,205 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-04-10 16:14:13,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:13,206 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:13,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 16:14:13,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:13,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:14:13,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:14:13,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:14:13,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:13,231 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-04-10 16:14:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:13,258 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-04-10 16:14:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:14:13,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-10 16:14:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:13,261 INFO L225 Difference]: With dead ends: 64 [2018-04-10 16:14:13,261 INFO L226 Difference]: Without dead ends: 64 [2018-04-10 16:14:13,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-10 16:14:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-04-10 16:14:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-10 16:14:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-04-10 16:14:13,265 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-04-10 16:14:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:13,265 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-04-10 16:14:13,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:14:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-04-10 16:14:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:14:13,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:13,266 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:13,266 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-04-10 16:14:13,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:13,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:13,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:14:13,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:13,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:13,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:13,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:13,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:14:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:14:13,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:13,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-04-10 16:14:13,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:14:13,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:14:13,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:14:13,478 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-04-10 16:14:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:13,611 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-10 16:14:13,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:14:13,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-10 16:14:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:13,613 INFO L225 Difference]: With dead ends: 68 [2018-04-10 16:14:13,613 INFO L226 Difference]: Without dead ends: 68 [2018-04-10 16:14:13,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:14:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-10 16:14:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-04-10 16:14:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-10 16:14:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-04-10 16:14:13,616 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 29 [2018-04-10 16:14:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:13,616 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-04-10 16:14:13,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:14:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-04-10 16:14:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:14:13,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:13,617 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:13,617 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-04-10 16:14:13,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:13,617 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:13,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:14:13,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:13,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:13,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:14:13,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:14:13,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:14:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 16:14:13,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:13,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-04-10 16:14:13,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:14:13,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:14:13,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:14:13,705 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 7 states. [2018-04-10 16:14:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:13,753 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-04-10 16:14:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:13,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-04-10 16:14:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:13,754 INFO L225 Difference]: With dead ends: 60 [2018-04-10 16:14:13,754 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 16:14:13,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:14:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 16:14:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-10 16:14:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-10 16:14:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-04-10 16:14:13,770 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 29 [2018-04-10 16:14:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:13,770 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-04-10 16:14:13,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:14:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-04-10 16:14:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:14:13,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:13,771 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:13,772 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-04-10 16:14:13,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:13,772 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:13,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:14:13,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:13,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:13,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:13,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:14:13,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:13,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-04-10 16:14:13,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:14:13,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:14:13,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:14:13,882 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-04-10 16:14:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,011 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-04-10 16:14:14,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:14:14,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-10 16:14:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,012 INFO L225 Difference]: With dead ends: 89 [2018-04-10 16:14:14,012 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 16:14:14,012 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:14:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 16:14:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-04-10 16:14:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-10 16:14:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-04-10 16:14:14,017 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 31 [2018-04-10 16:14:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,017 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-04-10 16:14:14,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:14:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-04-10 16:14:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:14:14,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:14,018 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:14,018 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-04-10 16:14:14,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:14,019 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:14,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:14,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:14:14,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:14,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:14,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-10 16:14:14,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:14,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-04-10 16:14:14,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:14:14,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:14:14,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:14:14,119 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 12 states. [2018-04-10 16:14:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,230 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-04-10 16:14:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:14:14,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-10 16:14:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,232 INFO L225 Difference]: With dead ends: 101 [2018-04-10 16:14:14,232 INFO L226 Difference]: Without dead ends: 101 [2018-04-10 16:14:14,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:14:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-10 16:14:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2018-04-10 16:14:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-10 16:14:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-04-10 16:14:14,237 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-04-10 16:14:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,237 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-04-10 16:14:14,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:14:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-04-10 16:14:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 16:14:14,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:14,238 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:14,238 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 2 times [2018-04-10 16:14:14,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:14,239 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:14,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:14,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-10 16:14:14,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:14,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:14,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:14,276 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 16:14:14,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:14,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:14,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:14:14,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:14,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:14,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:14,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 16:14:14,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:14,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:14:14,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:14,318 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-04-10 16:14:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-10 16:14:14,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:14,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-04-10 16:14:14,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:14:14,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:14:14,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-04-10 16:14:14,323 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-04-10 16:14:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,468 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-04-10 16:14:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:14:14,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-10 16:14:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,469 INFO L225 Difference]: With dead ends: 111 [2018-04-10 16:14:14,470 INFO L226 Difference]: Without dead ends: 70 [2018-04-10 16:14:14,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=175, Unknown=1, NotChecked=28, Total=272 [2018-04-10 16:14:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-10 16:14:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-04-10 16:14:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-10 16:14:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-04-10 16:14:14,473 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2018-04-10 16:14:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,473 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-04-10 16:14:14,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:14:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-04-10 16:14:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 16:14:14,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:14,474 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:14,475 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1139004847, now seen corresponding path program 2 times [2018-04-10 16:14:14,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:14,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:14,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:14,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-04-10 16:14:14,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:14,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:14:14,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:14:14,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:14:14,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:14:14,523 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-04-10 16:14:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,563 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-04-10 16:14:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:14,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-04-10 16:14:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,564 INFO L225 Difference]: With dead ends: 68 [2018-04-10 16:14:14,564 INFO L226 Difference]: Without dead ends: 62 [2018-04-10 16:14:14,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:14:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-10 16:14:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-04-10 16:14:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-10 16:14:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-04-10 16:14:14,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 52 [2018-04-10 16:14:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,573 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-04-10 16:14:14,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:14:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-04-10 16:14:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 16:14:14,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:14,574 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:14,574 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2136218585, now seen corresponding path program 3 times [2018-04-10 16:14:14,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:14,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:14,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:14,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:14,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 16:14:14,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:14,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:14:14,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-10 16:14:14,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:14,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 16:14:14,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:14,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-04-10 16:14:14,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:14:14,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:14:14,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:14:14,750 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2018-04-10 16:14:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:14,961 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-04-10 16:14:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:14:14,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-04-10 16:14:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:14,962 INFO L225 Difference]: With dead ends: 89 [2018-04-10 16:14:14,962 INFO L226 Difference]: Without dead ends: 0 [2018-04-10 16:14:14,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:14:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-10 16:14:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-10 16:14:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-10 16:14:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-10 16:14:14,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-04-10 16:14:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:14,963 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-10 16:14:14,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:14:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-10 16:14:14,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-10 16:14:14,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:14:14 BoogieIcfgContainer [2018-04-10 16:14:14,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:14:14,968 INFO L168 Benchmark]: Toolchain (without parser) took 2790.93 ms. Allocated memory was 404.2 MB in the beginning and 674.8 MB in the end (delta: 270.5 MB). Free memory was 342.2 MB in the beginning and 547.4 MB in the end (delta: -205.1 MB). Peak memory consumption was 65.4 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:14,970 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 404.2 MB. Free memory is still 363.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:14:14,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.38 ms. Allocated memory is still 404.2 MB. Free memory was 342.2 MB in the beginning and 331.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:14,970 INFO L168 Benchmark]: Boogie Preprocessor took 26.81 ms. Allocated memory is still 404.2 MB. Free memory is still 331.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:14:14,970 INFO L168 Benchmark]: RCFGBuilder took 226.29 ms. Allocated memory was 404.2 MB in the beginning and 610.8 MB in the end (delta: 206.6 MB). Free memory was 331.6 MB in the beginning and 572.9 MB in the end (delta: -241.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:14,971 INFO L168 Benchmark]: TraceAbstraction took 2354.48 ms. Allocated memory was 610.8 MB in the beginning and 674.8 MB in the end (delta: 64.0 MB). Free memory was 572.9 MB in the beginning and 547.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 89.5 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:14,972 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 404.2 MB. Free memory is still 363.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 180.38 ms. Allocated memory is still 404.2 MB. Free memory was 342.2 MB in the beginning and 331.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.81 ms. Allocated memory is still 404.2 MB. Free memory is still 331.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 226.29 ms. Allocated memory was 404.2 MB in the beginning and 610.8 MB in the end (delta: 206.6 MB). Free memory was 331.6 MB in the beginning and 572.9 MB in the end (delta: -241.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2354.48 ms. Allocated memory was 610.8 MB in the beginning and 674.8 MB in the end (delta: 64.0 MB). Free memory was 572.9 MB in the beginning and 547.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 89.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 2.3s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 341 SDtfs, 564 SDslu, 889 SDs, 0 SdLazy, 990 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 220 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 92 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 590 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 573 ConstructedInterpolants, 26 QuantifiedInterpolants, 68749 SizeOfPredicates, 13 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 238/296 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-14-14-979.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-14-14-979.csv Received shutdown request...