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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:14:25,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:14:25,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:14:25,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:14:25,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:14:25,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:14:25,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:14:25,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:14:25,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:14:25,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:14:25,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:14:25,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:14:25,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:14:25,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:14:25,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:14:25,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:14:25,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:14:25,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:14:25,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:14:25,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:14:25,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:14:25,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:14:25,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:14:25,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:14:25,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:14:25,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:14:25,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:14:25,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:14:25,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:14:25,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:14:25,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:14:25,300 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:25,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:14:25,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:14:25,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:14:25,318 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:14:25,318 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:14:25,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:14:25,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:14:25,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:14:25,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:14:25,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:14:25,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:14:25,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:14:25,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:14:25,320 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:14:25,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:14:25,320 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:14:25,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:14:25,353 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:14:25,357 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:14:25,358 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:14:25,358 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:14:25,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-04-10 16:14:25,727 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa7c43e57d [2018-04-10 16:14:25,811 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:14:25,811 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:14:25,812 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-04-10 16:14:25,813 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:14:25,813 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:14:25,813 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:14:25,813 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-04-10 16:14:25,813 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo ('foo') in ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-04-10 16:14:25,813 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:14:25,813 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:14:25,825 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa7c43e57d [2018-04-10 16:14:25,828 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:14:25,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:14:25,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:14:25,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:14:25,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:14:25,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:14:25" (1/1) ... [2018-04-10 16:14:25,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1a5a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:25, skipping insertion in model container [2018-04-10 16:14:25,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:14:25" (1/1) ... [2018-04-10 16:14:25,851 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:14:25,862 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:14:25,987 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:14:26,006 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:14:26,011 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 16:14:26,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:26 WrapperNode [2018-04-10 16:14:26,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:14:26,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:14:26,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:14:26,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:14:26,027 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:26" (1/1) ... [2018-04-10 16:14:26,027 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:26" (1/1) ... [2018-04-10 16:14:26,033 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:26" (1/1) ... [2018-04-10 16:14:26,034 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:26" (1/1) ... [2018-04-10 16:14:26,037 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:26" (1/1) ... [2018-04-10 16:14:26,042 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:26" (1/1) ... [2018-04-10 16:14:26,043 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:26" (1/1) ... [2018-04-10 16:14:26,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:14:26,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:14:26,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:14:26,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:14:26,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:26" (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:26,094 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:14:26,095 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:14:26,095 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo [2018-04-10 16:14:26,095 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:14:26,095 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo [2018-04-10 16:14:26,095 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:14:26,095 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:14:26,095 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:14:26,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:14:26,096 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:14:26,096 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:14:26,096 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:14:26,096 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:14:26,360 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:14:26,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:14:26 BoogieIcfgContainer [2018-04-10 16:14:26,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:14:26,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:14:26,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:14:26,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:14:26,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:14:25" (1/3) ... [2018-04-10 16:14:26,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408baa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:14:26, skipping insertion in model container [2018-04-10 16:14:26,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:14:26" (2/3) ... [2018-04-10 16:14:26,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408baa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:14:26, skipping insertion in model container [2018-04-10 16:14:26,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:14:26" (3/3) ... [2018-04-10 16:14:26,366 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-04-10 16:14:26,372 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:14:26,377 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 16:14:26,401 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:14:26,402 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:14:26,402 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:14:26,402 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:14:26,402 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:14:26,402 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:14:26,402 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:14:26,402 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:14:26,402 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:14:26,403 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:14:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-10 16:14:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-10 16:14:26,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:26,420 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:26,420 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash -895474378, now seen corresponding path program 1 times [2018-04-10 16:14:26,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:26,425 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:26,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:26,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:26,491 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:26,536 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:26,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:26,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:14:26,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:14:26,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:14:26,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:26,548 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-10 16:14:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:26,601 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-10 16:14:26,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:14:26,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-10 16:14:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:26,610 INFO L225 Difference]: With dead ends: 63 [2018-04-10 16:14:26,610 INFO L226 Difference]: Without dead ends: 59 [2018-04-10 16:14:26,611 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:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-10 16:14:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-10 16:14:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 16:14:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-10 16:14:26,641 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-10 16:14:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:26,641 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-10 16:14:26,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:14:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-10 16:14:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:14:26,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:26,643 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:26,643 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1597342241, now seen corresponding path program 1 times [2018-04-10 16:14:26,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:26,643 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:26,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:26,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:26,666 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:26,697 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:26,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:26,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:14:26,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:14:26,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:14:26,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:14:26,700 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-10 16:14:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:26,732 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-10 16:14:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:14:26,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-10 16:14:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:26,735 INFO L225 Difference]: With dead ends: 60 [2018-04-10 16:14:26,735 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 16:14:26,735 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:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 16:14:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-10 16:14:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 16:14:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-10 16:14:26,741 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-10 16:14:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:26,741 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-10 16:14:26,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:14:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-10 16:14:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:14:26,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:26,742 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:26,742 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997981, now seen corresponding path program 1 times [2018-04-10 16:14:26,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:26,742 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:26,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:26,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:26,753 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:26,788 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:26,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:26,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:14:26,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:26,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:26,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:26,789 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-04-10 16:14:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:26,834 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-04-10 16:14:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:26,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:14:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:26,838 INFO L225 Difference]: With dead ends: 51 [2018-04-10 16:14:26,838 INFO L226 Difference]: Without dead ends: 51 [2018-04-10 16:14:26,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-10 16:14:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-10 16:14:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-10 16:14:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-10 16:14:26,842 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-04-10 16:14:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:26,843 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-10 16:14:26,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-10 16:14:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:14:26,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:26,844 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:26,844 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997980, now seen corresponding path program 1 times [2018-04-10 16:14:26,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:26,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:26,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:26,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:26,856 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:26,930 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:26,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:26,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:14:26,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:14:26,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:14:26,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:26,931 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-10 16:14:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:27,001 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-04-10 16:14:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:27,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 16:14:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:27,002 INFO L225 Difference]: With dead ends: 53 [2018-04-10 16:14:27,002 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 16:14:27,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:14:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 16:14:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-10 16:14:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 16:14:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-10 16:14:27,006 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-04-10 16:14:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:27,007 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-10 16:14:27,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:14:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-10 16:14:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:14:27,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:27,008 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] [2018-04-10 16:14:27,008 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash -869005287, now seen corresponding path program 1 times [2018-04-10 16:14:27,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:27,008 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:27,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,019 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:27,084 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:27,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:27,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:14:27,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:14:27,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:14:27,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:14:27,085 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-04-10 16:14:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:27,153 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-04-10 16:14:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:14:27,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-10 16:14:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:27,154 INFO L225 Difference]: With dead ends: 72 [2018-04-10 16:14:27,155 INFO L226 Difference]: Without dead ends: 72 [2018-04-10 16:14:27,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:14:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-10 16:14:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-04-10 16:14:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-10 16:14:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-04-10 16:14:27,159 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 22 [2018-04-10 16:14:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:27,159 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-04-10 16:14:27,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:14:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-04-10 16:14:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 16:14:27,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:27,160 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:27,160 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash -994035242, now seen corresponding path program 1 times [2018-04-10 16:14:27,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:27,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:27,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,174 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:27,208 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:27,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:27,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:14:27,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:14:27,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:14:27,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:14:27,209 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-04-10 16:14:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:27,237 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-04-10 16:14:27,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:27,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-10 16:14:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:27,238 INFO L225 Difference]: With dead ends: 72 [2018-04-10 16:14:27,238 INFO L226 Difference]: Without dead ends: 72 [2018-04-10 16:14:27,238 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:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-10 16:14:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-04-10 16:14:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-10 16:14:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-04-10 16:14:27,242 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2018-04-10 16:14:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:27,242 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-04-10 16:14:27,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:14:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-04-10 16:14:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:14:27,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:27,244 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:27,244 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:27,244 INFO L82 PathProgramCache]: Analyzing trace with hash 701046357, now seen corresponding path program 1 times [2018-04-10 16:14:27,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:27,244 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:27,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,253 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:27,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-10 16:14:27,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:27,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:27,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:27,359 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:27,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:27,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-04-10 16:14:27,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:14:27,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:14:27,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:14:27,361 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-04-10 16:14:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:27,532 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-04-10 16:14:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:14:27,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-10 16:14:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:27,533 INFO L225 Difference]: With dead ends: 102 [2018-04-10 16:14:27,534 INFO L226 Difference]: Without dead ends: 102 [2018-04-10 16:14:27,534 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:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-10 16:14:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2018-04-10 16:14:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-10 16:14:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-04-10 16:14:27,539 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 31 [2018-04-10 16:14:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:27,539 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-04-10 16:14:27,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:14:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-04-10 16:14:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:14:27,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:27,542 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:27,542 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -301543559, now seen corresponding path program 1 times [2018-04-10 16:14:27,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:27,543 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:27,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,551 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:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:14:27,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:14:27,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:14:27,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:14:27,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:14:27,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:27,611 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-04-10 16:14:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:27,671 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-04-10 16:14:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:27,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-10 16:14:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:27,672 INFO L225 Difference]: With dead ends: 83 [2018-04-10 16:14:27,672 INFO L226 Difference]: Without dead ends: 80 [2018-04-10 16:14:27,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:14:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-10 16:14:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-04-10 16:14:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-10 16:14:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-10 16:14:27,677 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 34 [2018-04-10 16:14:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:27,677 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-10 16:14:27,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:14:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-10 16:14:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:14:27,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:27,678 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:27,678 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 425510769, now seen corresponding path program 2 times [2018-04-10 16:14:27,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:27,678 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:27,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,691 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:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 16:14:27,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:27,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:27,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:27,768 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:14:27,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:27,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-10 16:14:27,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:27,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-04-10 16:14:27,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:14:27,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:14:27,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:14:27,792 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 10 states. [2018-04-10 16:14:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:27,894 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-04-10 16:14:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:14:27,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-10 16:14:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:27,895 INFO L225 Difference]: With dead ends: 90 [2018-04-10 16:14:27,895 INFO L226 Difference]: Without dead ends: 90 [2018-04-10 16:14:27,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:14:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-10 16:14:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2018-04-10 16:14:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 16:14:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-04-10 16:14:27,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2018-04-10 16:14:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:27,899 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-04-10 16:14:27,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:14:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-04-10 16:14:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:14:27,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:27,900 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:14:27,900 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash -297393667, now seen corresponding path program 1 times [2018-04-10 16:14:27,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:27,900 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:27,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:14:27,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,910 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:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 16:14:27,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:27,945 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:27,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:27,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 16:14:27,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:14:27,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-04-10 16:14:27,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:14:27,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:14:27,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:27,973 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-04-10 16:14:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:28,013 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-04-10 16:14:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:14:28,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-04-10 16:14:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:28,014 INFO L225 Difference]: With dead ends: 98 [2018-04-10 16:14:28,014 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 16:14:28,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:14:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 16:14:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 76. [2018-04-10 16:14:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-10 16:14:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-04-10 16:14:28,019 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 49 [2018-04-10 16:14:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:28,019 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-04-10 16:14:28,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:14:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-04-10 16:14:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 16:14:28,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:14:28,021 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:28,021 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:14:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1497535843, now seen corresponding path program 2 times [2018-04-10 16:14:28,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:14:28,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:14:28,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:14:28,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:14:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:14:28,038 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:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-10 16:14:28,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:28,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:28,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:14:28,109 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 16:14:28,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:28,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:14:28,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:28,154 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:28,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:28,156 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:28,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:28,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:28,216 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:28,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:28,218 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:28,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:28,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:14:28,242 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:28,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:14:28,244 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:28,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 16:14:28,263 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:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-04-10 16:14:28,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:14:28,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-04-10 16:14:28,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:14:28,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:14:28,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-04-10 16:14:28,277 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 10 states. [2018-04-10 16:14:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:14:28,528 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-04-10 16:14:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:14:28,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-04-10 16:14:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:14:28,529 INFO L225 Difference]: With dead ends: 110 [2018-04-10 16:14:28,529 INFO L226 Difference]: Without dead ends: 0 [2018-04-10 16:14:28,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=250, Unknown=1, NotChecked=34, Total=380 [2018-04-10 16:14:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-10 16:14:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-10 16:14:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-10 16:14:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-10 16:14:28,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2018-04-10 16:14:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:14:28,530 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-10 16:14:28,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:14:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-10 16:14:28,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-10 16:14:28,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:14:28 BoogieIcfgContainer [2018-04-10 16:14:28,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:14:28,539 INFO L168 Benchmark]: Toolchain (without parser) took 2710.62 ms. Allocated memory was 405.8 MB in the beginning and 663.7 MB in the end (delta: 257.9 MB). Free memory was 345.5 MB in the beginning and 606.2 MB in the end (delta: -260.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:14:28,540 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 405.8 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:14:28,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.61 ms. Allocated memory is still 405.8 MB. Free memory was 344.8 MB in the beginning and 334.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:28,540 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 405.8 MB. Free memory was 334.2 MB in the beginning and 332.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:28,540 INFO L168 Benchmark]: RCFGBuilder took 316.46 ms. Allocated memory was 405.8 MB in the beginning and 612.9 MB in the end (delta: 207.1 MB). Free memory was 332.9 MB in the beginning and 573.6 MB in the end (delta: -240.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:28,540 INFO L168 Benchmark]: TraceAbstraction took 2176.52 ms. Allocated memory was 612.9 MB in the beginning and 663.7 MB in the end (delta: 50.9 MB). Free memory was 573.6 MB in the beginning and 606.2 MB in the end (delta: -32.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:28,542 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.14 ms. Allocated memory is still 405.8 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.61 ms. Allocated memory is still 405.8 MB. Free memory was 344.8 MB in the beginning and 334.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 405.8 MB. Free memory was 334.2 MB in the beginning and 332.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 316.46 ms. Allocated memory was 405.8 MB in the beginning and 612.9 MB in the end (delta: 207.1 MB). Free memory was 332.9 MB in the beginning and 573.6 MB in the end (delta: -240.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2176.52 ms. Allocated memory was 612.9 MB in the beginning and 663.7 MB in the end (delta: 50.9 MB). Free memory was 573.6 MB in the beginning and 606.2 MB in the end (delta: -32.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 23]: 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 - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: 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.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 366 SDtfs, 545 SDslu, 840 SDs, 0 SdLazy, 812 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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, 11 MinimizatonAttempts, 133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 502 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 487 ConstructedInterpolants, 26 QuantifiedInterpolants, 61520 SizeOfPredicates, 3 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 152/204 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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-14-28-548.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-14-28-548.csv Received shutdown request...