java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 16:28:40,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 16:28:40,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 16:28:40,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 16:28:40,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 16:28:40,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 16:28:40,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 16:28:40,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 16:28:40,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 16:28:40,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 16:28:40,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 16:28:40,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 16:28:40,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 16:28:40,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 16:28:40,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 16:28:40,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 16:28:40,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 16:28:40,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 16:28:40,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 16:28:40,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 16:28:40,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 16:28:40,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 16:28:40,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 16:28:40,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 16:28:40,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 16:28:40,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 16:28:40,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 16:28:40,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 16:28:40,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 16:28:40,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 16:28:40,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 16:28:40,937 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-11 16:28:40,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 16:28:40,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 16:28:40,960 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 16:28:40,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 16:28:40,960 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 16:28:40,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 16:28:40,961 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 16:28:40,961 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 16:28:40,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 16:28:40,961 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 16:28:40,961 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 16:28:40,961 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 16:28:40,962 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 16:28:40,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 16:28:40,962 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 16:28:40,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 16:28:40,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 16:28:40,962 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 16:28:40,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 16:28:40,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:28:40,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 16:28:40,963 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 16:28:40,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 16:28:40,963 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 16:28:40,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 16:28:41,004 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 16:28:41,008 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 16:28:41,010 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 16:28:41,010 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 16:28:41,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-04-11 16:28:41,300 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd52ab4747 [2018-04-11 16:28:41,401 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 16:28:41,401 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 16:28:41,402 INFO L168 CDTParser]: Scanning ArraysOfVariableLength_true-valid-memsafety.c [2018-04-11 16:28:41,402 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 16:28:41,402 INFO L215 ultiparseSymbolTable]: [2018-04-11 16:28:41,403 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 16:28:41,403 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-11 16:28:41,403 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-11 16:28:41,403 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 16:28:41,403 INFO L233 ultiparseSymbolTable]: [2018-04-11 16:28:41,415 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd52ab4747 [2018-04-11 16:28:41,419 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 16:28:41,420 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 16:28:41,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 16:28:41,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 16:28:41,426 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 16:28:41,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d4dd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41, skipping insertion in model container [2018-04-11 16:28:41,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,440 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:28:41,448 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:28:41,544 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:28:41,565 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:28:41,569 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-11 16:28:41,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41 WrapperNode [2018-04-11 16:28:41,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 16:28:41,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 16:28:41,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 16:28:41,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 16:28:41,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... [2018-04-11 16:28:41,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 16:28:41,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 16:28:41,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 16:28:41,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 16:28:41,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:28:41,647 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 16:28:41,647 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 16:28:41,648 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-11 16:28:41,648 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 16:28:41,648 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 16:28:41,852 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 16:28:41,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:28:41 BoogieIcfgContainer [2018-04-11 16:28:41,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 16:28:41,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 16:28:41,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 16:28:41,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 16:28:41,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 04:28:41" (1/3) ... [2018-04-11 16:28:41,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c894fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:28:41, skipping insertion in model container [2018-04-11 16:28:41,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:28:41" (2/3) ... [2018-04-11 16:28:41,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c894fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:28:41, skipping insertion in model container [2018-04-11 16:28:41,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:28:41" (3/3) ... [2018-04-11 16:28:41,859 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-04-11 16:28:41,866 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 16:28:41,870 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-04-11 16:28:41,896 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 16:28:41,897 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 16:28:41,897 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 16:28:41,897 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 16:28:41,897 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 16:28:41,898 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 16:28:41,898 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 16:28:41,898 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 16:28:41,898 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 16:28:41,899 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 16:28:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-04-11 16:28:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 16:28:41,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:41,917 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:41,917 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 154629517, now seen corresponding path program 1 times [2018-04-11 16:28:41,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:41,924 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:41,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:41,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:41,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:41,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:42,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:42,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:28:42,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 16:28:42,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 16:28:42,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 16:28:42,021 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-04-11 16:28:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:42,035 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-04-11 16:28:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 16:28:42,036 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-11 16:28:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:42,042 INFO L225 Difference]: With dead ends: 49 [2018-04-11 16:28:42,042 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 16:28:42,044 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-11 16:28:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 16:28:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-11 16:28:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 16:28:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-04-11 16:28:42,068 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-04-11 16:28:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:42,069 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-04-11 16:28:42,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 16:28:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-04-11 16:28:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 16:28:42,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:42,069 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:42,069 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1849425411, now seen corresponding path program 1 times [2018-04-11 16:28:42,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:42,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:42,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:42,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:42,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:28:42,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:28:42,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:28:42,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:28:42,162 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-04-11 16:28:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:42,295 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-04-11 16:28:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:28:42,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 16:28:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:42,297 INFO L225 Difference]: With dead ends: 73 [2018-04-11 16:28:42,297 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 16:28:42,297 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:28:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 16:28:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-04-11 16:28:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 16:28:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-04-11 16:28:42,302 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-04-11 16:28:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:42,303 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-04-11 16:28:42,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:28:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-04-11 16:28:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 16:28:42,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:42,304 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:42,304 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash -779177800, now seen corresponding path program 1 times [2018-04-11 16:28:42,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:42,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:42,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:42,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:42,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:28:42,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 16:28:42,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 16:28:42,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:28:42,334 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-04-11 16:28:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:42,349 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-04-11 16:28:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 16:28:42,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-04-11 16:28:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:42,352 INFO L225 Difference]: With dead ends: 55 [2018-04-11 16:28:42,352 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 16:28:42,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:28:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 16:28:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 16:28:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 16:28:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-11 16:28:42,355 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-04-11 16:28:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:42,355 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-11 16:28:42,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 16:28:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-11 16:28:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 16:28:42,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:42,356 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:42,356 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash -779177799, now seen corresponding path program 1 times [2018-04-11 16:28:42,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:42,356 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:42,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:42,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:42,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:28:42,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:28:42,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:28:42,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:28:42,402 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-04-11 16:28:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:42,445 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-04-11 16:28:42,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:28:42,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 16:28:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:42,446 INFO L225 Difference]: With dead ends: 65 [2018-04-11 16:28:42,446 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 16:28:42,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:28:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 16:28:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-04-11 16:28:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 16:28:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-11 16:28:42,451 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-04-11 16:28:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:42,451 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-11 16:28:42,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:28:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-11 16:28:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 16:28:42,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:42,452 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:42,452 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash 226405917, now seen corresponding path program 1 times [2018-04-11 16:28:42,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:42,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:42,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:28:42,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:42,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:28:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:28:42,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:28:42,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:28:42,512 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-04-11 16:28:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:42,571 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-04-11 16:28:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:28:42,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 16:28:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:42,572 INFO L225 Difference]: With dead ends: 69 [2018-04-11 16:28:42,572 INFO L226 Difference]: Without dead ends: 69 [2018-04-11 16:28:42,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:28:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-11 16:28:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-04-11 16:28:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-11 16:28:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-04-11 16:28:42,579 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-04-11 16:28:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:42,580 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-04-11 16:28:42,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:28:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-04-11 16:28:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 16:28:42,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:42,581 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:42,581 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1571351062, now seen corresponding path program 1 times [2018-04-11 16:28:42,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:42,581 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:42,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:42,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:42,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:28:42,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:28:42,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:28:42,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:28:42,618 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-04-11 16:28:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:42,664 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-11 16:28:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:28:42,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 16:28:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:42,665 INFO L225 Difference]: With dead ends: 60 [2018-04-11 16:28:42,666 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 16:28:42,666 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-11 16:28:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 16:28:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-11 16:28:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 16:28:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-11 16:28:42,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-04-11 16:28:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:42,670 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-11 16:28:42,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:28:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-11 16:28:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 16:28:42,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:42,671 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:42,671 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1571351061, now seen corresponding path program 1 times [2018-04-11 16:28:42,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:42,671 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:42,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:42,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:42,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:42,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:42,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:42,845 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-11 16:28:42,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:28:42,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:28:42,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:28:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:28:42,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:28:42,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-04-11 16:28:42,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 16:28:42,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 16:28:42,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 16:28:42,905 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 11 states. [2018-04-11 16:28:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:43,096 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-04-11 16:28:43,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 16:28:43,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-11 16:28:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:43,097 INFO L225 Difference]: With dead ends: 72 [2018-04-11 16:28:43,098 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 16:28:43,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-04-11 16:28:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 16:28:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2018-04-11 16:28:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-11 16:28:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-04-11 16:28:43,102 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-04-11 16:28:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:43,102 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-04-11 16:28:43,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 16:28:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-04-11 16:28:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 16:28:43,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:43,103 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:43,103 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1318599725, now seen corresponding path program 1 times [2018-04-11 16:28:43,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:43,104 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:43,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:43,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 16:28:43,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:28:43,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:28:43,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:28:43,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:28:43,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:28:43,204 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-04-11 16:28:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:43,251 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-04-11 16:28:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:28:43,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-11 16:28:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:43,253 INFO L225 Difference]: With dead ends: 64 [2018-04-11 16:28:43,253 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 16:28:43,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:28:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 16:28:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-04-11 16:28:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 16:28:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-04-11 16:28:43,263 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-04-11 16:28:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:43,263 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-04-11 16:28:43,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:28:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-04-11 16:28:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 16:28:43,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:43,264 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, 1] [2018-04-11 16:28:43,264 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1420824426, now seen corresponding path program 1 times [2018-04-11 16:28:43,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:43,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:43,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:43,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:43,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:43,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:43,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:43,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:28:43,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-11 16:28:43,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:28:43,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:28:43,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:28:43,327 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-04-11 16:28:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:43,371 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-11 16:28:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:28:43,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-11 16:28:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:43,373 INFO L225 Difference]: With dead ends: 83 [2018-04-11 16:28:43,373 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 16:28:43,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:28:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 16:28:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-04-11 16:28:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 16:28:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-11 16:28:43,381 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-04-11 16:28:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:43,382 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-11 16:28:43,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:28:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-11 16:28:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 16:28:43,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:43,383 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-11 16:28:43,383 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1549959115, now seen corresponding path program 1 times [2018-04-11 16:28:43,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:43,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:43,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:43,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:43,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:43,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:28:43,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:28:43,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-04-11 16:28:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 16:28:43,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 16:28:43,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-11 16:28:43,492 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 11 states. [2018-04-11 16:28:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:43,592 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-04-11 16:28:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:28:43,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-11 16:28:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:43,593 INFO L225 Difference]: With dead ends: 98 [2018-04-11 16:28:43,593 INFO L226 Difference]: Without dead ends: 98 [2018-04-11 16:28:43,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-04-11 16:28:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-11 16:28:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2018-04-11 16:28:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 16:28:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-04-11 16:28:43,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-04-11 16:28:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:43,596 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-04-11 16:28:43,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 16:28:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-04-11 16:28:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 16:28:43,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:43,596 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-11 16:28:43,597 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2056533948, now seen corresponding path program 2 times [2018-04-11 16:28:43,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:43,597 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:43,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:43,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 16:28:43,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:43,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:43,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:28:43,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-11 16:28:43,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:28:43,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:43,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:28:43,663 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-11 16:28:43,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:28:43,667 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-11 16:28:43,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 16:28:43,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:28:43,695 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-11 16:28:43,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:28:43,697 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-11 16:28:43,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-11 16:28:43,715 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (store |c_old(#valid)| |main_~#b~0.base| 0) |c_#valid|))) is different from true [2018-04-11 16:28:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-04-11 16:28:43,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:28:43,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-04-11 16:28:43,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 16:28:43,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 16:28:43,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-04-11 16:28:43,720 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 9 states. [2018-04-11 16:28:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:43,868 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-04-11 16:28:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 16:28:43,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-04-11 16:28:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:43,869 INFO L225 Difference]: With dead ends: 109 [2018-04-11 16:28:43,869 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 16:28:43,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=175, Unknown=1, NotChecked=28, Total=272 [2018-04-11 16:28:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 16:28:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-04-11 16:28:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 16:28:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-04-11 16:28:43,873 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2018-04-11 16:28:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:43,873 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-04-11 16:28:43,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 16:28:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-04-11 16:28:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 16:28:43,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:43,874 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:43,874 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-11 16:28:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1293117989, now seen corresponding path program 2 times [2018-04-11 16:28:43,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:43,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:43,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:28:43,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:43,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 16:28:43,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:43,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:43,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:28:43,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:28:43,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:28:43,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-11 16:28:44,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:28:44,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 15 [2018-04-11 16:28:44,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:28:44,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:28:44,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:28:44,058 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 15 states. [2018-04-11 16:28:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:44,256 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-11 16:28:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 16:28:44,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-04-11 16:28:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:44,256 INFO L225 Difference]: With dead ends: 88 [2018-04-11 16:28:44,256 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 16:28:44,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:28:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 16:28:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 16:28:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 16:28:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 16:28:44,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-04-11 16:28:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:44,257 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 16:28:44,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:28:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 16:28:44,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 16:28:44,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 04:28:44 BoogieIcfgContainer [2018-04-11 16:28:44,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 16:28:44,261 INFO L168 Benchmark]: Toolchain (without parser) took 2842.12 ms. Allocated memory was 397.4 MB in the beginning and 686.3 MB in the end (delta: 288.9 MB). Free memory was 336.7 MB in the beginning and 587.4 MB in the end (delta: -250.7 MB). Peak memory consumption was 38.2 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:44,262 INFO L168 Benchmark]: CDTParser took 1.22 ms. Allocated memory is still 397.4 MB. Free memory is still 357.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 16:28:44,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.57 ms. Allocated memory is still 397.4 MB. Free memory was 336.2 MB in the beginning and 326.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:44,262 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 397.4 MB. Free memory was 326.3 MB in the beginning and 324.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:44,262 INFO L168 Benchmark]: RCFGBuilder took 247.07 ms. Allocated memory was 397.4 MB in the beginning and 606.6 MB in the end (delta: 209.2 MB). Free memory was 324.9 MB in the beginning and 569.8 MB in the end (delta: -244.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:44,263 INFO L168 Benchmark]: TraceAbstraction took 2408.09 ms. Allocated memory was 606.6 MB in the beginning and 686.3 MB in the end (delta: 79.7 MB). Free memory was 569.8 MB in the beginning and 587.4 MB in the end (delta: -17.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:44,263 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22 ms. Allocated memory is still 397.4 MB. Free memory is still 357.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.57 ms. Allocated memory is still 397.4 MB. Free memory was 336.2 MB in the beginning and 326.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.32 ms. Allocated memory is still 397.4 MB. Free memory was 326.3 MB in the beginning and 324.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 247.07 ms. Allocated memory was 397.4 MB in the beginning and 606.6 MB in the end (delta: 209.2 MB). Free memory was 324.9 MB in the beginning and 569.8 MB in the end (delta: -244.9 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2408.09 ms. Allocated memory was 606.6 MB in the beginning and 686.3 MB in the end (delta: 79.7 MB). Free memory was 569.8 MB in the beginning and 587.4 MB in the end (delta: -17.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: 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 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 2.3s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 686 SDslu, 823 SDs, 0 SdLazy, 851 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=10, 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, 12 MinimizatonAttempts, 103 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 529 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 512 ConstructedInterpolants, 20 QuantifiedInterpolants, 62538 SizeOfPredicates, 10 NumberOfNonLiveVariables, 519 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 128/159 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/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_16-28-44-269.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_16-28-44-269.csv Received shutdown request...