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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:37:00,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:37:00,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:37:00,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:37:00,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:37:00,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:37:00,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:37:00,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:37:00,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:37:00,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:37:00,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:37:00,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:37:00,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:37:00,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:37:00,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:37:00,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:37:00,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:37:00,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:37:00,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:37:00,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:37:00,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:37:00,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:37:00,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:37:00,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:37:00,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:37:00,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:37:00,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:37:00,716 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:37:00,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:37:00,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:37:00,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:37:00,717 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:37:00,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:37:00,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:37:00,728 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:37:00,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:37:00,729 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:37:00,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:37:00,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:37:00,729 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:37:00,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:37:00,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:37:00,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:37:00,730 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:37:00,730 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:37:00,730 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:37:00,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:37:00,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:37:00,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:37:00,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:37:00,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:37:00,731 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:37:00,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:37:00,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:37:00,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:37:00,732 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:37:00,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:37:00,773 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:37:00,776 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:37:00,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:37:00,778 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:37:00,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:00,919 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:37:00,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:37:00,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:00,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:37:00,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:37:00,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:00" (1/1) ... [2018-02-02 10:37:00,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dff28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:00, skipping insertion in model container [2018-02-02 10:37:00,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:00" (1/1) ... [2018-02-02 10:37:00,946 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:00,976 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:01,065 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:01,076 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:01,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01 WrapperNode [2018-02-02 10:37:01,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:01,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:37:01,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:37:01,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:37:01,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (1/1) ... [2018-02-02 10:37:01,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:37:01,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:37:01,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:37:01,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:37:01,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (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-02-02 10:37:01,139 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:37:01,139 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:37:01,140 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-02-02 10:37:01,140 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:37:01,140 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:37:01,140 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:37:01,140 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:37:01,140 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:37:01,140 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:37:01,141 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:37:01,141 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-02-02 10:37:01,141 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:37:01,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:37:01,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:37:01,260 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:37:01,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:01 BoogieIcfgContainer [2018-02-02 10:37:01,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:37:01,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:37:01,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:37:01,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:37:01,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:37:00" (1/3) ... [2018-02-02 10:37:01,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e1cfff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:01, skipping insertion in model container [2018-02-02 10:37:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:01" (2/3) ... [2018-02-02 10:37:01,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e1cfff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:01, skipping insertion in model container [2018-02-02 10:37:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:01" (3/3) ... [2018-02-02 10:37:01,265 INFO L107 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:01,270 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:37:01,274 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 10:37:01,304 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:37:01,304 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:37:01,304 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:37:01,304 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:37:01,304 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:37:01,304 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:37:01,304 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:37:01,304 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:37:01,305 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:37:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-02 10:37:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:37:01,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:01,324 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:01,325 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-02-02 10:37:01,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:01,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:01,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:37:01,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,564 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(<= 1 main_~length1~0), 36#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 37#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 10:37:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:01,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:01,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:01,576 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-02-02 10:37:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:01,688 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-02-02 10:37:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:37:01,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 10:37:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:01,695 INFO L225 Difference]: With dead ends: 29 [2018-02-02 10:37:01,696 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 10:37:01,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:37:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 10:37:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 10:37:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 10:37:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-02 10:37:01,720 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-02 10:37:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:01,721 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-02 10:37:01,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-02 10:37:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:37:01,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:01,721 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:01,721 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-02-02 10:37:01,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:01,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:01,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:37:01,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,759 INFO L182 omatonBuilderFactory]: Interpolants [96#false, 97#(= 1 (select |#valid| |main_#t~malloc3.base|)), 98#(= 1 (select |#valid| main_~nondetString1~0.base)), 95#true] [2018-02-02 10:37:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:37:01,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:37:01,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:37:01,760 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-02-02 10:37:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:01,786 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-02 10:37:01,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:37:01,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 10:37:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:01,787 INFO L225 Difference]: With dead ends: 25 [2018-02-02 10:37:01,787 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 10:37:01,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 10:37:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 10:37:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 10:37:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-02 10:37:01,790 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-02-02 10:37:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:01,790 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-02 10:37:01,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:37:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-02 10:37:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:37:01,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:01,791 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:01,791 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-02-02 10:37:01,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:01,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:01,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:37:01,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,847 INFO L182 omatonBuilderFactory]: Interpolants [151#true, 152#false, 153#(= 1 (select |#valid| main_~nondetString1~0.base)), 154#(= 1 (select |#valid| |strlen_rec_#in~p.base|)), 155#(= 1 (select |#valid| strlen_rec_~p.base))] [2018-02-02 10:37:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:01,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:01,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:01,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:01,847 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-02-02 10:37:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:01,887 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-02-02 10:37:01,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:37:01,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 10:37:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:01,888 INFO L225 Difference]: With dead ends: 24 [2018-02-02 10:37:01,888 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 10:37:01,888 INFO L554 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-02-02 10:37:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 10:37:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 10:37:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 10:37:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-02-02 10:37:01,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-02-02 10:37:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:01,892 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-02-02 10:37:01,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-02-02 10:37:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:37:01,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:01,893 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:01,893 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-02-02 10:37:01,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:01,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:02,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:37:02,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,027 INFO L182 omatonBuilderFactory]: Interpolants [208#(<= 1 main_~length1~0), 209#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 210#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 211#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 212#(and (= 0 |strlen_rec_#in~p.offset|) (<= 1 (select |#length| |strlen_rec_#in~p.base|))), 213#(and (<= 1 (select |#length| strlen_rec_~p.base)) (= strlen_rec_~p.offset 0)), 206#true, 207#false] [2018-02-02 10:37:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:37:02,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:37:02,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:37:02,028 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-02-02 10:37:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:02,153 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-02 10:37:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:37:02,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-02-02 10:37:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:02,154 INFO L225 Difference]: With dead ends: 31 [2018-02-02 10:37:02,154 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 10:37:02,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 10:37:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 10:37:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:37:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-02 10:37:02,158 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-02-02 10:37:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:02,158 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-02 10:37:02,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:37:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-02 10:37:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:37:02,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:02,159 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:02,159 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-02-02 10:37:02,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:02,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:02,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:37:02,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,272 INFO L182 omatonBuilderFactory]: Interpolants [288#(= |strlen_rec_#t~mem0| 0), 280#true, 281#false, 282#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 283#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1)), 284#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 285#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 286#(= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|)), 287#(= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))] [2018-02-02 10:37:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:37:02,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:37:02,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:37:02,273 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-02-02 10:37:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:02,388 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-02 10:37:02,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:37:02,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 10:37:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:02,389 INFO L225 Difference]: With dead ends: 45 [2018-02-02 10:37:02,389 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 10:37:02,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:37:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 10:37:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-02-02 10:37:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 10:37:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 10:37:02,398 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-02-02 10:37:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:02,398 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 10:37:02,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:37:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 10:37:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:37:02,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:02,401 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:02,401 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:02,402 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-02-02 10:37:02,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:02,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:02,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:37:02,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,566 INFO L182 omatonBuilderFactory]: Interpolants [384#true, 385#false, 386#(<= 1 main_~length1~0), 387#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 388#(and (<= 1 main_~length1~0) (or (= (+ main_~nondetString1~0.offset main_~length1~0) 1) (= main_~length1~0 (select |#length| main_~nondetString1~0.base))) (= main_~nondetString1~0.offset 0)), 389#(and (or (<= 2 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset))) (= main_~nondetString1~0.offset 0)), 390#(and (= 0 |strlen_rec_#in~p.offset|) (or (<= 2 (select |#length| |strlen_rec_#in~p.base|)) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|)))), 391#(and (or (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset)) (<= 2 (select |#length| strlen_rec_~p.base))) (= strlen_rec_~p.offset 0)), 392#(and (or (= |strlen_rec_#t~mem0| 0) (<= 2 (select |#length| strlen_rec_~p.base))) (= strlen_rec_~p.offset 0)), 393#(and (= strlen_rec_~p.offset 0) (<= 2 (select |#length| strlen_rec_~p.base))), 394#(and (<= 1 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|))), 395#(and (<= 1 strlen_rec_~p.offset) (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)))] [2018-02-02 10:37:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:37:02,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:37:02,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:37:02,567 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 12 states. [2018-02-02 10:37:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:02,770 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 10:37:02,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:37:02,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 10:37:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:02,776 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:37:02,776 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:37:02,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:37:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:37:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-02-02 10:37:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:37:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-02 10:37:02,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-02-02 10:37:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:02,782 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-02 10:37:02,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:37:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-02 10:37:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:37:02,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:02,783 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:02,783 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-02-02 10:37:02,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:02,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:02,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:37:02,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,996 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (or (= 0 (select (select |#memory_int| strlen_rec_~p.base) 1)) (<= (select |#length| strlen_rec_~p.base) 1) (<= 3 (select |#length| strlen_rec_~p.base))) (= strlen_rec_~p.offset 0)), 513#(and (or (and (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1)) (<= |strlen_rec_#in~p.offset| 1)) (<= (select |#length| |strlen_rec_#in~p.base|) |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 2) (select |#length| |strlen_rec_#in~p.base|))) (<= 1 |strlen_rec_#in~p.offset|)), 514#(and (or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (and (= 1 strlen_rec_~p.offset) (= 0 (select (select |#memory_int| strlen_rec_~p.base) strlen_rec_~p.offset))) (<= (select |#length| strlen_rec_~p.base) strlen_rec_~p.offset)) (<= 1 strlen_rec_~p.offset)), 515#(and (<= 1 strlen_rec_~p.offset) (or (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (and (= 1 strlen_rec_~p.offset) (= |strlen_rec_#t~mem0| 0)))), 516#(and (<= (+ strlen_rec_~p.offset 2) (select |#length| strlen_rec_~p.base)) (<= 1 strlen_rec_~p.offset)), 517#(and (<= 2 |strlen_rec_#in~p.offset|) (<= (+ |strlen_rec_#in~p.offset| 1) (select |#length| |strlen_rec_#in~p.base|))), 518#(and (<= (+ strlen_rec_~p.offset 1) (select |#length| strlen_rec_~p.base)) (<= 2 strlen_rec_~p.offset)), 506#true, 507#false, 508#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 509#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 510#(and (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= main_~nondetString1~0.offset 0)), 511#(and (or (<= (select |#length| |strlen_rec_#in~p.base|) 1) (<= 3 (select |#length| |strlen_rec_#in~p.base|)) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) 1))) (= 0 |strlen_rec_#in~p.offset|))] [2018-02-02 10:37:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:02,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:37:02,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:37:02,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:37:02,997 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 13 states. [2018-02-02 10:37:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:03,244 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-02-02 10:37:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:37:03,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-02-02 10:37:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:03,245 INFO L225 Difference]: With dead ends: 56 [2018-02-02 10:37:03,245 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 10:37:03,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:37:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 10:37:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-02 10:37:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:37:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 10:37:03,251 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 21 [2018-02-02 10:37:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:03,251 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 10:37:03,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:37:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 10:37:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:37:03,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:03,252 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:03,252 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 10:37:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-02-02 10:37:03,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:03,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:03,268 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:37:03,271 INFO L168 Benchmark]: Toolchain (without parser) took 2350.85 ms. Allocated memory was 406.3 MB in the beginning and 627.0 MB in the end (delta: 220.7 MB). Free memory was 364.5 MB in the beginning and 474.7 MB in the end (delta: -110.2 MB). Peak memory consumption was 110.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:03,272 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 406.3 MB. Free memory is still 369.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:37:03,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.09 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 353.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:03,272 INFO L168 Benchmark]: Boogie Preprocessor took 21.30 ms. Allocated memory is still 406.3 MB. Free memory was 353.9 MB in the beginning and 351.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:03,273 INFO L168 Benchmark]: RCFGBuilder took 158.27 ms. Allocated memory is still 406.3 MB. Free memory was 351.3 MB in the beginning and 337.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:03,273 INFO L168 Benchmark]: TraceAbstraction took 2009.19 ms. Allocated memory was 406.3 MB in the beginning and 627.0 MB in the end (delta: 220.7 MB). Free memory was 337.3 MB in the beginning and 474.7 MB in the end (delta: -137.4 MB). Peak memory consumption was 83.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:03,275 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.20 ms. Allocated memory is still 406.3 MB. Free memory is still 369.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.09 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 353.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.30 ms. Allocated memory is still 406.3 MB. Free memory was 353.9 MB in the beginning and 351.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 158.27 ms. Allocated memory is still 406.3 MB. Free memory was 351.3 MB in the beginning and 337.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2009.19 ms. Allocated memory was 406.3 MB in the beginning and 627.0 MB in the end (delta: 220.7 MB). Free memory was 337.3 MB in the beginning and 474.7 MB in the end (delta: -137.4 MB). Peak memory consumption was 83.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-37-03-281.csv Received shutdown request...