java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:16:40,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:16:40,304 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:16:40,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:16:40,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:16:40,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:16:40,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:16:40,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:16:40,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:16:40,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:16:40,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:16:40,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:16:40,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:16:40,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:16:40,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:16:40,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:16:40,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:16:40,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:16:40,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:16:40,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:16:40,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:16:40,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:16:40,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:16:40,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:16:40,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:16:40,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:16:40,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:16:40,337 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:16:40,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:16:40,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:16:40,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:16:40,338 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:16:40,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:16:40,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:16:40,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:16:40,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:16:40,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:16:40,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:16:40,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:16:40,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:16:40,350 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:16:40,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:16:40,350 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:16:40,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:16:40,382 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:16:40,385 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:16:40,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:16:40,386 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:16:40,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i [2018-02-04 17:16:40,508 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:16:40,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:16:40,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:40,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:16:40,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:16:40,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c55627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40, skipping insertion in model container [2018-02-04 17:16:40,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,527 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:40,553 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:40,643 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:40,655 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:40,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40 WrapperNode [2018-02-04 17:16:40,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:40,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:16:40,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:16:40,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:16:40,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (1/1) ... [2018-02-04 17:16:40,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:16:40,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:16:40,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:16:40,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:16:40,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (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 17:16:40,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:16:40,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:16:40,726 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-02-04 17:16:40,726 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 17:16:40,727 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:16:40,727 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:16:40,728 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:16:40,728 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-02-04 17:16:40,728 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 17:16:40,728 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:16:40,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:16:40,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:16:40,912 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:16:40,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:40 BoogieIcfgContainer [2018-02-04 17:16:40,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:16:40,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:16:40,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:16:40,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:16:40,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:16:40" (1/3) ... [2018-02-04 17:16:40,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19159100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:40, skipping insertion in model container [2018-02-04 17:16:40,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:40" (2/3) ... [2018-02-04 17:16:40,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19159100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:40, skipping insertion in model container [2018-02-04 17:16:40,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:40" (3/3) ... [2018-02-04 17:16:40,918 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe_false-valid-deref.i [2018-02-04 17:16:40,923 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:16:40,927 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 17:16:40,956 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:16:40,957 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:16:40,957 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:16:40,957 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:16:40,957 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:16:40,957 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:16:40,957 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:16:40,957 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:16:40,958 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:16:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-04 17:16:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:16:40,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:40,985 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:40,985 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1167838739, now seen corresponding path program 1 times [2018-02-04 17:16:41,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:41,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:41,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:41,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:41,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:41,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:41,186 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 17:16:41,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:41,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:16:41,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:16:41,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:16:41,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:16:41,206 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-02-04 17:16:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:41,293 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 17:16:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:16:41,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 17:16:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:41,352 INFO L225 Difference]: With dead ends: 64 [2018-02-04 17:16:41,352 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 17:16:41,353 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 17:16:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 17:16:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 17:16:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 17:16:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 17:16:41,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 11 [2018-02-04 17:16:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:41,383 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 17:16:41,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:16:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 17:16:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:16:41,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:41,383 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:41,384 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1167838738, now seen corresponding path program 1 times [2018-02-04 17:16:41,384 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:41,384 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:41,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:41,386 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:41,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:41,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:41,475 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 17:16:41,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:41,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:16:41,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:16:41,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:16:41,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:16:41,477 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-02-04 17:16:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:41,510 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 17:16:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:16:41,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 17:16:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:41,511 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:16:41,512 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 17:16:41,512 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 17:16:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 17:16:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 17:16:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:16:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 17:16:41,518 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 11 [2018-02-04 17:16:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:41,519 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 17:16:41,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:16:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 17:16:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:16:41,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:41,520 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:41,520 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1764023599, now seen corresponding path program 1 times [2018-02-04 17:16:41,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:41,520 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:41,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:41,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:41,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:41,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:41,554 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:41,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:41,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:41,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:41,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:41,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:16:41,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:41,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:41,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:16:41,669 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |build_nondet_String_#t~malloc1.base| 1))) is different from true [2018-02-04 17:16:41,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:16:41,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:41,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:16:41,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:16:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-02-04 17:16:41,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:16:41,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 17:16:41,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:16:41,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:16:41,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=74, Unknown=1, NotChecked=16, Total=110 [2018-02-04 17:16:41,708 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 11 states. [2018-02-04 17:16:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:42,024 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 17:16:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:16:42,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 17:16:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:42,025 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:16:42,025 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:16:42,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=168, Unknown=2, NotChecked=26, Total=240 [2018-02-04 17:16:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:16:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 17:16:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:16:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-02-04 17:16:42,031 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 29 [2018-02-04 17:16:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:42,032 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-02-04 17:16:42,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:16:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-02-04 17:16:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:16:42,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:42,033 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:42,033 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1764023598, now seen corresponding path program 1 times [2018-02-04 17:16:42,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:42,034 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:42,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:42,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:42,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:42,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:42,057 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:42,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:42,057 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:42,058 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:42,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:42,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:16:42,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:42,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:42,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:16:42,215 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int) (build_nondet_String_~length~0 Int)) (and (<= 1 build_nondet_String_~length~0) (<= build_nondet_String_~length~0 1) (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| build_nondet_String_~length~0) |c_#length|))) is different from true [2018-02-04 17:16:42,232 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:16:42,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:16:42,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:42,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:16:42,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:23 [2018-02-04 17:16:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 17:16:42,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:16:42,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:16:42,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:16:42,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:16:42,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=176, Unknown=3, NotChecked=26, Total=240 [2018-02-04 17:16:42,278 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 16 states. [2018-02-04 17:16:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:42,801 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2018-02-04 17:16:42,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:16:42,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-02-04 17:16:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:42,804 INFO L225 Difference]: With dead ends: 129 [2018-02-04 17:16:42,804 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 17:16:42,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=341, Unknown=3, NotChecked=38, Total=462 [2018-02-04 17:16:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 17:16:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2018-02-04 17:16:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 17:16:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2018-02-04 17:16:42,809 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 29 [2018-02-04 17:16:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:42,810 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2018-02-04 17:16:42,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:16:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2018-02-04 17:16:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:16:42,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:42,811 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:42,811 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1505858160, now seen corresponding path program 1 times [2018-02-04 17:16:42,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:42,811 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:42,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:42,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:42,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:42,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:42,828 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:42,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:42,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:42,829 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:42,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:42,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:16:42,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:42,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:16:42,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:42,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:42,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:16:42,990 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int) (build_nondet_String_~length~0 Int)) (and (= 0 (select |c_old(#valid)| |build_nondet_String_#t~malloc1.base|)) (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| build_nondet_String_~length~0) |c_#length|))) is different from true [2018-02-04 17:16:42,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:42,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:43,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:16:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-02-04 17:16:43,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:16 [2018-02-04 17:16:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-02-04 17:16:43,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:16:43,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 17:16:43,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:16:43,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:16:43,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2018-02-04 17:16:43,044 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 14 states. [2018-02-04 17:16:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:43,442 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2018-02-04 17:16:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:16:43,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-02-04 17:16:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:43,444 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:16:43,444 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 17:16:43,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=312, Unknown=2, NotChecked=36, Total=420 [2018-02-04 17:16:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 17:16:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2018-02-04 17:16:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 17:16:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2018-02-04 17:16:43,448 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 29 [2018-02-04 17:16:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:43,449 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2018-02-04 17:16:43,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:16:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2018-02-04 17:16:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:16:43,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:43,449 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:43,450 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1545168880, now seen corresponding path program 2 times [2018-02-04 17:16:43,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:43,450 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:43,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:43,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:43,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:43,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:43,460 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:43,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:43,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:43,461 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:16:43,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:16:43,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:16:43,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:43,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:16:43,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:16:43,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:16:43,563 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int) (build_nondet_String_~length~0 Int)) (and (<= (select |c_old(#valid)| |build_nondet_String_#t~malloc1.base|) 0) (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| build_nondet_String_~length~0) |c_#length|))) is different from true [2018-02-04 17:16:43,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:43,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:16:43,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:43,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:43,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:16:43,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:43,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-02-04 17:16:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-02-04 17:16:43,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:16:43,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 17:16:43,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:16:43,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:16:43,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2018-02-04 17:16:43,624 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 13 states. [2018-02-04 17:16:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:43,901 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2018-02-04 17:16:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:16:43,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-02-04 17:16:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:43,902 INFO L225 Difference]: With dead ends: 130 [2018-02-04 17:16:43,902 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 17:16:43,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2018-02-04 17:16:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 17:16:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 60. [2018-02-04 17:16:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:16:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-02-04 17:16:43,908 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 29 [2018-02-04 17:16:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:43,908 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-02-04 17:16:43,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:16:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-02-04 17:16:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:16:43,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:43,909 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:43,909 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:16:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -464489331, now seen corresponding path program 1 times [2018-02-04 17:16:43,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:43,909 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:43,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:43,910 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:16:43,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:16:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:16:43,947 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:16:43,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:16:43 BoogieIcfgContainer [2018-02-04 17:16:43,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:16:43,971 INFO L168 Benchmark]: Toolchain (without parser) took 3462.01 ms. Allocated memory was 401.6 MB in the beginning and 657.5 MB in the end (delta: 255.9 MB). Free memory was 358.5 MB in the beginning and 488.4 MB in the end (delta: -129.9 MB). Peak memory consumption was 125.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:43,971 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:16:43,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.43 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:43,972 INFO L168 Benchmark]: Boogie Preprocessor took 28.53 ms. Allocated memory is still 401.6 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:43,972 INFO L168 Benchmark]: RCFGBuilder took 224.44 ms. Allocated memory is still 401.6 MB. Free memory was 346.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:43,972 INFO L168 Benchmark]: TraceAbstraction took 3057.18 ms. Allocated memory was 401.6 MB in the beginning and 657.5 MB in the end (delta: 255.9 MB). Free memory was 324.5 MB in the beginning and 488.4 MB in the end (delta: -163.9 MB). Peak memory consumption was 92.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:43,973 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.15 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.43 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.53 ms. Allocated memory is still 401.6 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.44 ms. Allocated memory is still 401.6 MB. Free memory was 346.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3057.18 ms. Allocated memory was 401.6 MB in the beginning and 657.5 MB in the end (delta: 255.9 MB). Free memory was 324.5 MB in the beginning and 488.4 MB in the end (delta: -163.9 MB). Peak memory consumption was 92.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: [L565] 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}] [L565] EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L565] char* s1 = build_nondet_String(); [L566] 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))={4:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L547] RET return nondetString; VAL [\result={4:0}, length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L566] EXPR build_nondet_String() VAL [build_nondet_String()={4:0}, s1={3:0}] [L566] char* s2 = build_nondet_String(); [L567] CALL cstrpbrk(s1,s2) VAL [s1={3:0}, s2={4:0}] [L551] const char *sc1; [L552] const char *s; [L553] int c; [L554] sc1 = s1 VAL [s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}, sc1={3:0}] [L554] EXPR, FCALL \read(*sc1) VAL [\read(*sc1)=0, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}, sc1={3:0}] [L554] COND FALSE !(*sc1 != '\0') [L562] RET return 0; VAL [\result={0:0}, s1={3:0}, s1={3:0}, s2={4:0}, s2={4:0}, sc1={3:0}] [L567] cstrpbrk(s1,s2) VAL [cstrpbrk(s1,s2)={0:0}, s1={3:0}, s2={4:0}] [L567] FCALL cstrpbrk(s1,s2) VAL [cstrpbrk(s1,s2)={0:0}, s1={3:0}, s2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 19 error locations. UNSAFE Result, 3.0s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 276 SDtfs, 602 SDslu, 630 SDs, 0 SdLazy, 1864 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 184 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 132 ConstructedInterpolants, 20 QuantifiedInterpolants, 27036 SizeOfPredicates, 40 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 11/32 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/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-16-43-979.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-16-43-979.csv Received shutdown request...