java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:40:54,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:40:54,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:40:54,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:40:54,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:40:54,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:40:54,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:40:54,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:40:54,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:40:54,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:40:54,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:40:54,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:40:54,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:40:54,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:40:54,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:40:54,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:40:54,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:40:54,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:40:54,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:40:54,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:40:54,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:40:54,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:40:54,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:40:54,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:40:54,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:40:54,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:40:54,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:40:54,106 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:40:54,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:40:54,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:40:54,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:40:54,107 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:40:54,116 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:40:54,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:40:54,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:40:54,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:40:54,118 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:40:54,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:40:54,118 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:40:54,118 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:40:54,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:40:54,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:40:54,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:40:54,119 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:40:54,119 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:40:54,119 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:40:54,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:40:54,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:40:54,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:40:54,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:40:54,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:40:54,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:40:54,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:40:54,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:40:54,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:40:54,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:40:54,165 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:40:54,168 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:40:54,170 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:40:54,170 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:40:54,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-02-04 01:40:54,323 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:40:54,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:40:54,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:40:54,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:40:54,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:40:54,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb6211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54, skipping insertion in model container [2018-02-04 01:40:54,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,353 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:40:54,383 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:40:54,465 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:40:54,477 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:40:54,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54 WrapperNode [2018-02-04 01:40:54,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:40:54,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:40:54,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:40:54,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:40:54,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (1/1) ... [2018-02-04 01:40:54,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:40:54,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:40:54,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:40:54,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:40:54,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (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-04 01:40:54,542 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:40:54,543 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:40:54,543 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-02-04 01:40:54,543 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-02-04 01:40:54,543 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 01:40:54,543 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:40:54,544 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-02-04 01:40:54,544 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-02-04 01:40:54,544 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:40:54,544 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:40:54,544 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:40:54,703 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:40:54,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:40:54 BoogieIcfgContainer [2018-02-04 01:40:54,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:40:54,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:40:54,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:40:54,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:40:54,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:40:54" (1/3) ... [2018-02-04 01:40:54,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221ed389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:40:54, skipping insertion in model container [2018-02-04 01:40:54,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:40:54" (2/3) ... [2018-02-04 01:40:54,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221ed389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:40:54, skipping insertion in model container [2018-02-04 01:40:54,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:40:54" (3/3) ... [2018-02-04 01:40:54,709 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-02-04 01:40:54,716 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:40:54,719 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 01:40:54,748 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:40:54,749 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:40:54,749 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:40:54,749 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:40:54,749 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:40:54,749 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:40:54,749 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:40:54,749 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:40:54,750 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:40:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-04 01:40:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 01:40:54,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:54,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:54,767 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:54,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965141, now seen corresponding path program 1 times [2018-02-04 01:40:54,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:54,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:54,899 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-04 01:40:54,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:40:54,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:40:54,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:54,903 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-04 01:40:54,904 INFO L182 omatonBuilderFactory]: Interpolants [53#true, 54#false, 55#(= 1 (select |#valid| |build_nondet_String_#t~malloc1.base|)), 56#(= 1 (select |#valid| build_nondet_String_~nondetString~0.base))] [2018-02-04 01:40:54,904 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-04 01:40:54,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:40:54,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:40:54,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:40:54,920 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2018-02-04 01:40:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:54,992 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-04 01:40:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:40:54,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 01:40:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:54,999 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:40:54,999 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 01:40:55,045 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-04 01:40:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 01:40:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 01:40:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:40:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 01:40:55,072 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2018-02-04 01:40:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:55,072 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 01:40:55,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:40:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 01:40:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 01:40:55,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:55,073 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:55,073 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965140, now seen corresponding path program 1 times [2018-02-04 01:40:55,074 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:55,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:55,177 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-04 01:40:55,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:40:55,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:40:55,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:55,178 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-04 01:40:55,179 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(<= 1 build_nondet_String_~length~0), 157#(and (<= 1 build_nondet_String_~length~0) (= build_nondet_String_~length~0 (select |#length| |build_nondet_String_#t~malloc1.base|)) (= 0 |build_nondet_String_#t~malloc1.offset|)), 158#(and (<= 1 build_nondet_String_~length~0) (= build_nondet_String_~length~0 (select |#length| build_nondet_String_~nondetString~0.base)) (= build_nondet_String_~nondetString~0.offset 0))] [2018-02-04 01:40:55,179 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-04 01:40:55,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:40:55,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:40:55,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:40:55,181 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-04 01:40:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:55,214 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-02-04 01:40:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:40:55,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 01:40:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:55,215 INFO L225 Difference]: With dead ends: 45 [2018-02-04 01:40:55,216 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 01:40:55,216 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-04 01:40:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 01:40:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 01:40:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 01:40:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 01:40:55,221 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-02-04 01:40:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:55,221 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 01:40:55,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:40:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 01:40:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:40:55,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:55,222 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:55,222 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:55,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925183, now seen corresponding path program 1 times [2018-02-04 01:40:55,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:55,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:55,327 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-04 01:40:55,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:40:55,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:40:55,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:55,328 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-04 01:40:55,329 INFO L182 omatonBuilderFactory]: Interpolants [256#(= 1 (select |#valid| main_~s~0.base)), 257#(= 1 (select |#valid| |cstrchr_#in~s.base|)), 258#(= 1 (select |#valid| cstrchr_~s.base)), 251#true, 252#false, 253#(= 1 (select |#valid| build_nondet_String_~nondetString~0.base)), 254#(= 1 (select |#valid| |build_nondet_String_#res.base|)), 255#(= 1 (select |#valid| |main_#t~ret9.base|))] [2018-02-04 01:40:55,329 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-04 01:40:55,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:40:55,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:40:55,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:40:55,329 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2018-02-04 01:40:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:55,419 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 01:40:55,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:40:55,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 01:40:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:55,420 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:40:55,420 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:40:55,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:40:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:40:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:40:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:40:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 01:40:55,423 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 19 [2018-02-04 01:40:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:55,423 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 01:40:55,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:40:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 01:40:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:40:55,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:55,423 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:55,423 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925182, now seen corresponding path program 1 times [2018-02-04 01:40:55,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:55,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:55,550 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-04 01:40:55,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:40:55,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:40:55,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:55,551 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-04 01:40:55,552 INFO L182 omatonBuilderFactory]: Interpolants [352#(and (= 0 |main_#t~ret9.offset|) (<= 1 (select |#length| |main_#t~ret9.base|))), 353#(and (<= 1 (select |#length| main_~s~0.base)) (= 0 main_~s~0.offset)), 354#(and (= 0 |cstrchr_#in~s.offset|) (<= 1 (select |#length| |cstrchr_#in~s.base|))), 355#(and (<= 1 (select |#length| cstrchr_~s.base)) (= cstrchr_~s.offset 0)), 345#true, 346#false, 347#(<= 1 build_nondet_String_~length~0), 348#(and (<= 1 build_nondet_String_~length~0) (= build_nondet_String_~length~0 (select |#length| |build_nondet_String_#t~malloc1.base|)) (= 0 |build_nondet_String_#t~malloc1.offset|)), 349#(and (= 0 build_nondet_String_~nondetString~0.offset) (<= 1 build_nondet_String_~length~0) (= build_nondet_String_~length~0 (select |#length| build_nondet_String_~nondetString~0.base))), 350#(and (= 0 build_nondet_String_~nondetString~0.offset) (<= 1 (select |#length| build_nondet_String_~nondetString~0.base))), 351#(and (<= 1 (select |#length| |build_nondet_String_#res.base|)) (= 0 |build_nondet_String_#res.offset|))] [2018-02-04 01:40:55,552 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-04 01:40:55,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:40:55,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:40:55,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:40:55,553 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-02-04 01:40:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:55,683 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-02-04 01:40:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:40:55,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-02-04 01:40:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:55,685 INFO L225 Difference]: With dead ends: 52 [2018-02-04 01:40:55,685 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 01:40:55,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:40:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 01:40:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-02-04 01:40:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:40:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 01:40:55,689 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 19 [2018-02-04 01:40:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:55,689 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 01:40:55,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:40:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 01:40:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:40:55,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:55,690 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:55,690 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash -908438943, now seen corresponding path program 1 times [2018-02-04 01:40:55,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:55,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:55,717 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-04 01:40:55,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:40:55,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:40:55,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:55,718 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-04 01:40:55,718 INFO L182 omatonBuilderFactory]: Interpolants [464#(not |cstrchr_#t~short5|), 462#true, 463#false] [2018-02-04 01:40:55,718 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-04 01:40:55,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:40:55,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:40:55,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:40:55,719 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-02-04 01:40:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:55,727 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 01:40:55,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:40:55,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-04 01:40:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:55,731 INFO L225 Difference]: With dead ends: 50 [2018-02-04 01:40:55,731 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 01:40:55,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:40:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 01:40:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 01:40:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:40:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 01:40:55,734 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2018-02-04 01:40:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:55,734 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 01:40:55,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:40:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 01:40:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:40:55,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:55,735 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:55,735 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1313023324, now seen corresponding path program 1 times [2018-02-04 01:40:55,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:55,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:55,915 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-04 01:40:55,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:40:55,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 01:40:55,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:55,916 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-04 01:40:55,916 INFO L182 omatonBuilderFactory]: Interpolants [576#(and (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (= |cstrchr_#t~mem3| (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset))), 577#(not |cstrchr_#t~short5|), 565#true, 566#false, 567#(and (<= 1 build_nondet_String_~length~0) (<= build_nondet_String_~length~0 1)), 568#(and (<= 1 build_nondet_String_~length~0) (= 0 |build_nondet_String_#t~malloc1.offset|) (<= build_nondet_String_~length~0 1)), 569#(and (= build_nondet_String_~nondetString~0.offset 0) (= (+ build_nondet_String_~nondetString~0.offset build_nondet_String_~length~0) 1)), 570#(and (= build_nondet_String_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| build_nondet_String_~nondetString~0.base) build_nondet_String_~nondetString~0.offset))), 571#(= 0 (select (select |#memory_int| |build_nondet_String_#res.base|) |build_nondet_String_#res.offset|)), 572#(= 0 (select (select |#memory_int| |main_#t~ret9.base|) |main_#t~ret9.offset|)), 573#(= 0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)), 574#(= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) |cstrchr_#in~s.offset|)), 575#(= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset))] [2018-02-04 01:40:55,917 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-04 01:40:55,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:40:55,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:40:55,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:40:55,917 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 13 states. [2018-02-04 01:40:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:56,087 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 01:40:56,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:40:56,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-04 01:40:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:56,088 INFO L225 Difference]: With dead ends: 77 [2018-02-04 01:40:56,088 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 01:40:56,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:40:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 01:40:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-04 01:40:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 01:40:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 01:40:56,094 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2018-02-04 01:40:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:56,095 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 01:40:56,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:40:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 01:40:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:40:56,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:56,096 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:56,096 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1293000230, now seen corresponding path program 1 times [2018-02-04 01:40:56,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:40:56,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:40:56,306 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-04 01:40:56,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:40:56,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:40:56,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:40:56,307 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-04 01:40:56,307 INFO L182 omatonBuilderFactory]: Interpolants [736#true, 737#false, 738#(<= 1 build_nondet_String_~length~0), 739#(and (<= 1 build_nondet_String_~length~0) (= build_nondet_String_~length~0 (select |#length| |build_nondet_String_#t~malloc1.base|)) (= 0 |build_nondet_String_#t~malloc1.offset|)), 740#(and (<= 1 build_nondet_String_~length~0) (= build_nondet_String_~length~0 (select |#length| build_nondet_String_~nondetString~0.base)) (= build_nondet_String_~nondetString~0.offset 0)), 741#(and (= build_nondet_String_~nondetString~0.offset 0) (or (<= 2 (+ (select |#length| build_nondet_String_~nondetString~0.base) build_nondet_String_~nondetString~0.offset)) (= 0 (select (select |#memory_int| build_nondet_String_~nondetString~0.base) build_nondet_String_~nondetString~0.offset)))), 742#(and (or (= 0 (select (select |#memory_int| |build_nondet_String_#res.base|) |build_nondet_String_#res.offset|)) (<= 2 (select |#length| |build_nondet_String_#res.base|))) (= 0 |build_nondet_String_#res.offset|)), 743#(and (or (<= 2 (select |#length| |main_#t~ret9.base|)) (= 0 (select (select |#memory_int| |main_#t~ret9.base|) |main_#t~ret9.offset|))) (= 0 |main_#t~ret9.offset|)), 744#(and (= 0 main_~s~0.offset) (or (<= 2 (select |#length| main_~s~0.base)) (= 0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))), 745#(and (or (= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) |cstrchr_#in~s.offset|)) (<= 2 (select |#length| |cstrchr_#in~s.base|))) (= 0 |cstrchr_#in~s.offset|)), 746#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset))) (= cstrchr_~s.offset 0)), 747#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (and (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (= |cstrchr_#t~mem3| (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)))) (= cstrchr_~s.offset 0)), 748#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (not |cstrchr_#t~short5|)) (= cstrchr_~s.offset 0)), 749#(and (<= 2 (select |#length| cstrchr_~s.base)) (= cstrchr_~s.offset 0)), 750#(and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 1) (select |#length| cstrchr_~s.base)))] [2018-02-04 01:40:56,307 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-04 01:40:56,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:40:56,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:40:56,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:40:56,308 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 15 states. [2018-02-04 01:40:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:40:56,651 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-02-04 01:40:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:40:56,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-02-04 01:40:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:40:56,652 INFO L225 Difference]: With dead ends: 91 [2018-02-04 01:40:56,652 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 01:40:56,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:40:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 01:40:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2018-02-04 01:40:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 01:40:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-02-04 01:40:56,655 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2018-02-04 01:40:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:40:56,656 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-02-04 01:40:56,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:40:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-02-04 01:40:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:40:56,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:40:56,656 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, 1, 1, 1, 1, 1, 1] [2018-02-04 01:40:56,656 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:40:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1770747854, now seen corresponding path program 1 times [2018-02-04 01:40:56,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:40:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:40:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:40:56,704 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 01:40:56,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:40:56 BoogieIcfgContainer [2018-02-04 01:40:56,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:40:56,724 INFO L168 Benchmark]: Toolchain (without parser) took 2399.66 ms. Allocated memory was 404.8 MB in the beginning and 627.6 MB in the end (delta: 222.8 MB). Free memory was 361.2 MB in the beginning and 469.0 MB in the end (delta: -107.7 MB). Peak memory consumption was 115.1 MB. Max. memory is 5.3 GB. [2018-02-04 01:40:56,724 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 404.8 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:40:56,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.55 ms. Allocated memory is still 404.8 MB. Free memory was 361.2 MB in the beginning and 350.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:40:56,725 INFO L168 Benchmark]: Boogie Preprocessor took 22.59 ms. Allocated memory is still 404.8 MB. Free memory was 350.7 MB in the beginning and 348.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:40:56,725 INFO L168 Benchmark]: RCFGBuilder took 199.55 ms. Allocated memory is still 404.8 MB. Free memory was 348.0 MB in the beginning and 328.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 01:40:56,725 INFO L168 Benchmark]: TraceAbstraction took 2018.89 ms. Allocated memory was 404.8 MB in the beginning and 627.6 MB in the end (delta: 222.8 MB). Free memory was 328.2 MB in the beginning and 469.0 MB in the end (delta: -140.8 MB). Peak memory consumption was 82.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:40:56,726 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.24 ms. Allocated memory is still 404.8 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.55 ms. Allocated memory is still 404.8 MB. Free memory was 361.2 MB in the beginning and 350.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.59 ms. Allocated memory is still 404.8 MB. Free memory was 350.7 MB in the beginning and 348.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 199.55 ms. Allocated memory is still 404.8 MB. Free memory was 348.0 MB in the beginning and 328.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2018.89 ms. Allocated memory was 404.8 MB in the beginning and 627.6 MB in the end (delta: 222.8 MB). Free memory was 328.2 MB in the beginning and 469.0 MB in the end (delta: -140.8 MB). Peak memory consumption was 82.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L556] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] EXPR, FCALL malloc(length * sizeof(char)) VAL [length=1, malloc(length * sizeof(char))={3:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L547] RET return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L556] EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L556] char* s = build_nondet_String(); [L557] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={3:0}] [L551] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] COND FALSE !(*s != '\0' && *s != (char)c) [L553] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] COND FALSE, EXPR !((*s == c) ? (char *) s : 0) VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] RET return ( (*s == c) ? (char *) s : 0 ); [L557] cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] [L557] FCALL cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 13 error locations. UNSAFE Result, 1.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 251 SDtfs, 276 SDslu, 872 SDs, 0 SdLazy, 762 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 4/6 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 13205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-40-56-734.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-40-56-734.csv Received shutdown request...