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/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:20,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:20,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:20,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:20,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:20,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:20,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:20,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:20,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:20,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:20,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:20,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:20,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:20,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:20,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:20,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:20,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:20,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:20,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:20,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:20,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:20,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:20,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:20,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:20,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:20,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:20,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:20,338 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:20,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:20,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:20,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:20,339 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:36:20,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:20,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:20,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:20,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:20,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:20,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:20,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:20,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:20,351 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:20,351 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:20,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:20,394 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:20,397 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:20,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:20,398 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:20,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:20,534 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:20,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:20,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:20,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:20,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:20,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab297d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20, skipping insertion in model container [2018-02-02 10:36:20,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,560 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:20,587 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:20,685 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:20,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:20,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20 WrapperNode [2018-02-02 10:36:20,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:20,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:20,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:20,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:20,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (1/1) ... [2018-02-02 10:36:20,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:20,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:20,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:20,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:20,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (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:36:20,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:20,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:20,762 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-02 10:36:20,762 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:20,762 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:20,762 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:20,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:20,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:20,867 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:20,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:20 BoogieIcfgContainer [2018-02-02 10:36:20,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:20,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:20,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:20,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:20,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:20" (1/3) ... [2018-02-02 10:36:20,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aafa8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:20, skipping insertion in model container [2018-02-02 10:36:20,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:20" (2/3) ... [2018-02-02 10:36:20,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aafa8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:20, skipping insertion in model container [2018-02-02 10:36:20,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:20" (3/3) ... [2018-02-02 10:36:20,872 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:20,878 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:20,883 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 10:36:20,905 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:20,906 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:20,906 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:20,906 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:20,906 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:20,906 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:20,906 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:20,906 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:20,907 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-02 10:36:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:20,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:20,926 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:20,926 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-02-02 10:36:20,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:21,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:21,095 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:36:21,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:21,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:36:21,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:21,099 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:36:21,099 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(= 1 (select |#valid| |main_#t~malloc3.base|)), 36#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 10:36:21,099 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:36:21,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:36:21,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:36:21,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:36:21,115 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-02-02 10:36:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:21,174 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-02 10:36:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:36:21,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 10:36:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:21,183 INFO L225 Difference]: With dead ends: 29 [2018-02-02 10:36:21,183 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 10:36:21,230 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:36:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 10:36:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 10:36:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 10:36:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-02 10:36:21,255 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-02 10:36:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:21,255 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-02 10:36:21,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:36:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-02 10:36:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:21,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:21,256 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:21,256 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-02-02 10:36:21,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:21,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:21,345 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:36:21,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:21,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:21,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:21,346 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:36:21,346 INFO L182 omatonBuilderFactory]: Interpolants [96#(<= 1 main_~length1~0), 97#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 98#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 94#true, 95#false] [2018-02-02 10:36:21,346 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:36:21,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:21,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:21,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:21,348 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-02 10:36:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:21,371 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-02 10:36:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:36:21,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 10:36:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:21,372 INFO L225 Difference]: With dead ends: 25 [2018-02-02 10:36:21,372 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 10:36:21,373 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:36:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 10:36:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 10:36:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 10:36:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-02 10:36:21,377 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-02-02 10:36:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:21,377 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-02 10:36:21,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-02 10:36:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:36:21,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:21,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:21,378 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-02-02 10:36:21,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:21,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:21,427 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:36:21,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:21,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:21,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:21,428 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:36:21,428 INFO L182 omatonBuilderFactory]: Interpolants [151#true, 152#false, 153#(= 1 (select |#valid| main_~nondetString1~0.base)), 154#(= 1 (select |#valid| |cstrlen_#in~s.base|)), 155#(= 1 (select |#valid| cstrlen_~p~0.base))] [2018-02-02 10:36:21,428 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:36:21,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:21,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:21,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:21,430 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-02-02 10:36:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:21,462 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-02-02 10:36:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:36:21,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:36:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:21,463 INFO L225 Difference]: With dead ends: 24 [2018-02-02 10:36:21,464 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 10:36:21,464 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:36:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 10:36:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 10:36:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 10:36:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-02 10:36:21,467 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-02-02 10:36:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:21,467 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-02 10:36:21,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-02 10:36:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:36:21,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:21,468 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:21,468 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-02-02 10:36:21,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:21,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:21,558 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:36:21,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:21,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:36:21,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:21,559 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:36:21,559 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 (<= 1 (select |#length| |cstrlen_#in~s.base|)) (= 0 |cstrlen_#in~s.offset|)), 213#(and (<= 1 (select |#length| cstrlen_~p~0.base)) (= cstrlen_~p~0.offset 0)), 206#true, 207#false] [2018-02-02 10:36:21,559 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:36:21,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:36:21,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:36:21,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:21,560 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-02-02 10:36:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:21,638 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-02-02 10:36:21,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:36:21,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-02 10:36:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:21,642 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:36:21,642 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:36:21,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:36:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-02-02 10:36:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 10:36:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-02 10:36:21,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-02-02 10:36:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:21,647 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-02 10:36:21,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:36:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-02 10:36:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:36:21,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:21,648 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:36:21,648 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:21,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-02-02 10:36:21,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:21,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:21,766 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:36:21,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:21,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:36:21,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:21,767 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:36:21,767 INFO L182 omatonBuilderFactory]: Interpolants [274#true, 275#false, 276#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 277#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1)), 278#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 279#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 280#(= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|)), 281#(= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset)), 282#(= |cstrlen_#t~mem0| 0)] [2018-02-02 10:36:21,767 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:36:21,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:36:21,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:36:21,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:21,768 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-02-02 10:36:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:21,852 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-02 10:36:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:36:21,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 10:36:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:21,853 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:36:21,853 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:36:21,854 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:36:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:36:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-02 10:36:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:36:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-02 10:36:21,857 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-02-02 10:36:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:21,858 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-02 10:36:21,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:36:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-02 10:36:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:36:21,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:21,858 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:36:21,859 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-02-02 10:36:21,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:21,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:21,998 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:36:21,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:21,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:36:21,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:21,999 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:36:21,999 INFO L182 omatonBuilderFactory]: Interpolants [372#true, 373#false, 374#(<= 1 main_~length1~0), 375#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 376#(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)), 377#(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)), 378#(and (= 0 |cstrlen_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|)) (<= 2 (select |#length| |cstrlen_#in~s.base|)))), 379#(and (or (<= 2 (select |#length| cstrlen_~p~0.base)) (= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset))) (= cstrlen_~p~0.offset 0)), 380#(and (or (<= 2 (select |#length| cstrlen_~p~0.base)) (= |cstrlen_#t~mem0| 0)) (= cstrlen_~p~0.offset 0)), 381#(and (<= 1 cstrlen_~p~0.offset) (<= (+ cstrlen_~p~0.offset 1) (select |#length| cstrlen_~p~0.base)))] [2018-02-02 10:36:21,999 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:36:21,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:36:21,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:36:21,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:22,000 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 10 states. [2018-02-02 10:36:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:22,172 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-02 10:36:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:36:22,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-02-02 10:36:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:22,173 INFO L225 Difference]: With dead ends: 47 [2018-02-02 10:36:22,173 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 10:36:22,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:36:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 10:36:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-02-02 10:36:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 10:36:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-02-02 10:36:22,177 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-02-02 10:36:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:22,178 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-02-02 10:36:22,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:36:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-02-02 10:36:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:22,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:22,178 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:22,179 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-02-02 10:36:22,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:22,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:22,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:22,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:36:22,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:22,359 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:36:22,359 INFO L182 omatonBuilderFactory]: Interpolants [481#true, 482#false, 483#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 484#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 485#(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)), 486#(and (or (<= 3 (select |#length| |cstrlen_#in~s.base|)) (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) 1)) (<= (select |#length| |cstrlen_#in~s.base|) 1)) (= 0 |cstrlen_#in~s.offset|)), 487#(and (or (<= 3 (select |#length| cstrlen_~p~0.base)) (= 0 (select (select |#memory_int| cstrlen_~p~0.base) 1)) (<= (select |#length| cstrlen_~p~0.base) 1)) (= cstrlen_~p~0.offset 0)), 488#(and (<= 1 cstrlen_~p~0.offset) (or (<= (+ cstrlen_~p~0.offset 2) (select |#length| cstrlen_~p~0.base)) (<= (select |#length| cstrlen_~p~0.base) cstrlen_~p~0.offset) (and (= 0 (select (select |#memory_int| cstrlen_~p~0.base) cstrlen_~p~0.offset)) (= 1 cstrlen_~p~0.offset)))), 489#(and (or (and (= |cstrlen_#t~mem0| 0) (= 1 cstrlen_~p~0.offset)) (<= (+ cstrlen_~p~0.offset 2) (select |#length| cstrlen_~p~0.base))) (<= 1 cstrlen_~p~0.offset)), 490#(and (<= (+ cstrlen_~p~0.offset 1) (select |#length| cstrlen_~p~0.base)) (<= 2 cstrlen_~p~0.offset))] [2018-02-02 10:36:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:22,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:36:22,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:36:22,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:22,360 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 10 states. [2018-02-02 10:36:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:22,553 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-02-02 10:36:22,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:36:22,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-02 10:36:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:22,554 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:36:22,554 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:36:22,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:36:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:36:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-02-02 10:36:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 10:36:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-02 10:36:22,559 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-02-02 10:36:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:22,559 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-02 10:36:22,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:36:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-02 10:36:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:36:22,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:22,560 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, 1, 1] [2018-02-02 10:36:22,560 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-02-02 10:36:22,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:22,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:22,576 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:36:22,578 INFO L168 Benchmark]: Toolchain (without parser) took 2043.60 ms. Allocated memory was 400.0 MB in the beginning and 620.8 MB in the end (delta: 220.7 MB). Free memory was 355.4 MB in the beginning and 506.2 MB in the end (delta: -150.8 MB). Peak memory consumption was 70.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:22,579 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:22,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.87 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 344.8 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:36:22,579 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 342.2 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:36:22,580 INFO L168 Benchmark]: RCFGBuilder took 140.57 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 327.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:22,580 INFO L168 Benchmark]: TraceAbstraction took 1709.96 ms. Allocated memory was 400.0 MB in the beginning and 620.8 MB in the end (delta: 220.7 MB). Free memory was 327.4 MB in the beginning and 506.2 MB in the end (delta: -178.8 MB). Peak memory consumption was 41.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:22,581 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 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.87 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 344.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.29 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 140.57 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 327.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1709.96 ms. Allocated memory was 400.0 MB in the beginning and 620.8 MB in the end (delta: 220.7 MB). Free memory was 327.4 MB in the beginning and 506.2 MB in the end (delta: -178.8 MB). Peak memory consumption was 41.9 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/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-36-22-586.csv Received shutdown request...