./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d5e76e59f87104cc83de8acda77b849da7d1b09 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:07:19,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:07:19,977 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:07:19,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:07:19,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:07:19,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:07:19,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:07:20,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:07:20,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:07:20,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:07:20,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:07:20,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:07:20,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:07:20,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:07:20,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:07:20,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:07:20,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:07:20,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:07:20,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:07:20,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:07:20,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:07:20,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:07:20,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:07:20,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:07:20,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:07:20,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:07:20,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:07:20,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:07:20,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:07:20,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:07:20,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:07:20,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:07:20,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:07:20,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:07:20,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:07:20,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:07:20,034 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:07:20,050 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:07:20,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:07:20,051 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:07:20,051 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:07:20,051 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:07:20,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:07:20,053 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:07:20,053 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:07:20,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:07:20,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:07:20,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:07:20,053 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:07:20,054 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:07:20,054 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:07:20,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:07:20,054 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:07:20,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:07:20,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:07:20,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:07:20,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:07:20,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:20,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:07:20,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:07:20,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:07:20,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:07:20,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d5e76e59f87104cc83de8acda77b849da7d1b09 [2019-01-14 18:07:20,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:07:20,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:07:20,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:07:20,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:07:20,121 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:07:20,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i [2019-01-14 18:07:20,193 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5277183e8/53b3e14f50d844f1b2b7b8b43c56e20d/FLAG0fe378ebe [2019-01-14 18:07:20,695 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:07:20,696 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i [2019-01-14 18:07:20,714 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5277183e8/53b3e14f50d844f1b2b7b8b43c56e20d/FLAG0fe378ebe [2019-01-14 18:07:21,000 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5277183e8/53b3e14f50d844f1b2b7b8b43c56e20d [2019-01-14 18:07:21,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:07:21,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:07:21,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:21,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:07:21,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:07:21,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21, skipping insertion in model container [2019-01-14 18:07:21,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:07:21,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:07:21,418 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:21,434 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:07:21,526 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:21,661 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:07:21,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21 WrapperNode [2019-01-14 18:07:21,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:21,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:07:21,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:07:21,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:07:21,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... [2019-01-14 18:07:21,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:07:21,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:07:21,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:07:21,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:07:21,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (1/1) ... No working directory specified, using /storage/repos/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 [2019-01-14 18:07:21,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:07:21,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:07:21,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:07:21,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:07:21,818 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2019-01-14 18:07:21,818 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2019-01-14 18:07:21,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:07:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:07:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:07:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:07:21,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:07:21,821 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:07:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:07:21,822 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:07:21,823 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:07:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:07:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:07:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:07:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:07:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:07:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:07:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:07:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:07:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:07:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:07:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:07:21,827 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:07:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:07:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:07:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:07:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:07:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:07:21,830 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:07:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:07:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:07:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:07:21,831 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:07:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:07:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:07:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:07:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:07:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:07:21,832 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:07:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:07:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:07:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:07:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:07:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:07:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:07:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:07:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:07:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:07:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:07:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:07:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:07:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:07:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:07:21,836 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:07:21,837 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:07:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:07:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:07:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:07:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:07:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:07:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:07:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:07:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2019-01-14 18:07:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:07:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:07:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2019-01-14 18:07:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:07:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:07:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:07:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:07:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:07:22,656 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:07:22,657 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:07:22,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:22 BoogieIcfgContainer [2019-01-14 18:07:22,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:07:22,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:07:22,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:07:22,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:07:22,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:07:21" (1/3) ... [2019-01-14 18:07:22,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a4fe73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:22, skipping insertion in model container [2019-01-14 18:07:22,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:21" (2/3) ... [2019-01-14 18:07:22,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a4fe73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:22, skipping insertion in model container [2019-01-14 18:07:22,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:22" (3/3) ... [2019-01-14 18:07:22,687 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe_false-valid-deref.i [2019-01-14 18:07:22,713 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:07:22,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-14 18:07:22,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-14 18:07:22,777 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:07:22,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:07:22,778 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:07:22,778 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:07:22,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:07:22,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:07:22,779 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:07:22,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:07:22,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:07:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-01-14 18:07:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:22,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:22,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:22,813 INFO L423 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash -295844002, now seen corresponding path program 1 times [2019-01-14 18:07:22,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:22,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:22,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:22,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:22,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:23,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:23,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:23,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:23,018 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-01-14 18:07:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:23,156 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-01-14 18:07:23,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:23,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:23,170 INFO L225 Difference]: With dead ends: 66 [2019-01-14 18:07:23,170 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 18:07:23,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 18:07:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 18:07:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 18:07:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-01-14 18:07:23,222 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 10 [2019-01-14 18:07:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:23,222 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-01-14 18:07:23,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-01-14 18:07:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:23,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:23,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:23,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash -295844001, now seen corresponding path program 1 times [2019-01-14 18:07:23,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:23,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:23,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:23,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:23,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:23,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:23,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:23,476 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 4 states. [2019-01-14 18:07:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:23,603 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-01-14 18:07:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:23,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:23,605 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:07:23,605 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:07:23,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:07:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 18:07:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 18:07:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-01-14 18:07:23,615 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 10 [2019-01-14 18:07:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:23,616 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-01-14 18:07:23,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-01-14 18:07:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:07:23,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:23,618 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:23,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1453589472, now seen corresponding path program 1 times [2019-01-14 18:07:23,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:23,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:23,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:23,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:24,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:07:24,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:24,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:28,465 INFO L478 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 [2019-01-14 18:07:28,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:28,495 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. [2019-01-14 18:07:28,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 18:07:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:28,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:28,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2019-01-14 18:07:28,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 18:07:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 18:07:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=140, Unknown=6, NotChecked=0, Total=182 [2019-01-14 18:07:28,582 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 14 states. [2019-01-14 18:07:29,191 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 18:07:29,646 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 18:07:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:35,053 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-14 18:07:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:07:35,054 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-14 18:07:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:35,057 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:07:35,057 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:07:35,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=82, Invalid=292, Unknown=6, NotChecked=0, Total=380 [2019-01-14 18:07:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:07:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-01-14 18:07:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 18:07:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-01-14 18:07:35,066 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 26 [2019-01-14 18:07:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:35,069 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-01-14 18:07:35,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 18:07:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-01-14 18:07:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 18:07:35,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:35,071 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:35,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1453589473, now seen corresponding path program 1 times [2019-01-14 18:07:35,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:35,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:35,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:35,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:07:35,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:35,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:35,557 INFO L478 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 [2019-01-14 18:07:35,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:35,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:35,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 18:07:36,036 WARN L860 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (= |c_#length| (store |c_old(#length)| build_nondet_String_~nondetString~0.base 1))) is different from true [2019-01-14 18:07:36,052 INFO L478 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 [2019-01-14 18:07:36,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:36,059 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. [2019-01-14 18:07:36,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-01-14 18:07:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-01-14 18:07:36,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:36,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-01-14 18:07:36,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 18:07:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 18:07:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2019-01-14 18:07:36,190 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 24 states. [2019-01-14 18:07:37,250 WARN L181 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-01-14 18:07:38,256 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-14 18:07:38,503 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-01-14 18:07:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,071 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2019-01-14 18:07:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 18:07:40,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-01-14 18:07:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,078 INFO L225 Difference]: With dead ends: 152 [2019-01-14 18:07:40,078 INFO L226 Difference]: Without dead ends: 152 [2019-01-14 18:07:40,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=169, Invalid=1166, Unknown=1, NotChecked=70, Total=1406 [2019-01-14 18:07:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-14 18:07:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 61. [2019-01-14 18:07:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 18:07:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-01-14 18:07:40,091 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 26 [2019-01-14 18:07:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,092 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-01-14 18:07:40,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 18:07:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-01-14 18:07:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:07:40,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,093 INFO L402 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, 1] [2019-01-14 18:07:40,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1690425434, now seen corresponding path program 1 times [2019-01-14 18:07:40,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 18:07:40,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:40,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:07:40,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:07:40,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:07:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:40,209 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 9 states. [2019-01-14 18:07:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,441 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-01-14 18:07:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:07:40,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-14 18:07:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,444 INFO L225 Difference]: With dead ends: 61 [2019-01-14 18:07:40,444 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 18:07:40,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:07:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 18:07:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-01-14 18:07:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 18:07:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-01-14 18:07:40,450 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 30 [2019-01-14 18:07:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-01-14 18:07:40,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:07:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-01-14 18:07:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:07:40,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,454 INFO L402 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, 1] [2019-01-14 18:07:40,454 INFO L423 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1690425433, now seen corresponding path program 1 times [2019-01-14 18:07:40,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:07:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:40,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:07:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:07:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:07:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:40,604 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 10 states. [2019-01-14 18:07:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:41,101 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2019-01-14 18:07:41,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:07:41,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-14 18:07:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:41,105 INFO L225 Difference]: With dead ends: 120 [2019-01-14 18:07:41,105 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 18:07:41,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:07:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 18:07:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2019-01-14 18:07:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 18:07:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2019-01-14 18:07:41,115 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 30 [2019-01-14 18:07:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:41,117 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2019-01-14 18:07:41,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:07:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2019-01-14 18:07:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:07:41,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:41,118 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 18:07:41,120 INFO L423 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1593424613, now seen corresponding path program 1 times [2019-01-14 18:07:41,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:41,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:41,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:07:41,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:41,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:07:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:07:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:07:41,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:07:41,287 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 11 states. [2019-01-14 18:07:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:41,562 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2019-01-14 18:07:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:07:41,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-01-14 18:07:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:41,565 INFO L225 Difference]: With dead ends: 119 [2019-01-14 18:07:41,565 INFO L226 Difference]: Without dead ends: 119 [2019-01-14 18:07:41,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:07:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-14 18:07:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 64. [2019-01-14 18:07:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 18:07:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-01-14 18:07:41,576 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 30 [2019-01-14 18:07:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:41,576 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-01-14 18:07:41,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:07:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-01-14 18:07:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 18:07:41,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:41,577 INFO L402 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, 1, 1] [2019-01-14 18:07:41,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -864136094, now seen corresponding path program 1 times [2019-01-14 18:07:41,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:41,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:07:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:07:41,653 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:07:41,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:07:41 BoogieIcfgContainer [2019-01-14 18:07:41,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:07:41,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:07:41,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:07:41,691 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:07:41,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:22" (3/4) ... [2019-01-14 18:07:41,695 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 18:07:41,756 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:07:41,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:07:41,757 INFO L168 Benchmark]: Toolchain (without parser) took 20753.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 952.7 MB in the beginning and 908.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:41,759 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:07:41,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:41,760 INFO L168 Benchmark]: Boogie Preprocessor took 91.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:41,762 INFO L168 Benchmark]: RCFGBuilder took 911.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:41,762 INFO L168 Benchmark]: TraceAbstraction took 19023.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 908.5 MB in the end (delta: 176.1 MB). Peak memory consumption was 235.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:41,764 INFO L168 Benchmark]: Witness Printer took 65.81 ms. Allocated memory is still 1.2 GB. Free memory is still 908.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:07:41,768 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 911.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19023.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 908.5 MB in the end (delta: 176.1 MB). Peak memory consumption was 235.9 MB. Max. memory is 11.5 GB. * Witness Printer took 65.81 ms. Allocated memory is still 1.2 GB. Free memory is still 908.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 567]: 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] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L546] nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L547] return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L565] RET, 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] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={1:0}, nondetString={1:0}] [L546] nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={1:0}, nondetString={1:0}] [L547] return nondetString; VAL [\result={1:0}, length=1, malloc(length * sizeof(char))={1:0}, nondetString={1:0}] [L566] RET, EXPR build_nondet_String() VAL [build_nondet_String()={1:0}, s1={3:0}] [L566] char* s2 = build_nondet_String(); [L567] CALL cstrpbrk(s1,s2) VAL [s1={3:0}, s2={1:0}] [L551] const char *sc1; [L552] const char *s; [L553] int c; [L554] sc1 = s1 VAL [s1={3:0}, s1={3:0}, s2={1:0}, s2={1:0}, sc1={3:0}] [L554] EXPR \read(*sc1) VAL [\read(*sc1)=0, s1={3:0}, s1={3:0}, s2={1:0}, s2={1:0}, sc1={3:0}] [L554] COND FALSE !(*sc1 != '\0') [L562] return 0; VAL [\result={0:0}, s1={3:0}, s1={3:0}, s2={1:0}, s2={1:0}, sc1={3:0}] [L567] RET cstrpbrk(s1,s2) VAL [cstrpbrk(s1,s2)={0:0}, s1={3:0}, s2={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 21 error locations. UNSAFE Result, 18.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 327 SDtfs, 858 SDslu, 1191 SDs, 0 SdLazy, 1727 SolverSat, 75 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=6, 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, 7 MinimizatonAttempts, 174 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 205 ConstructedInterpolants, 7 QuantifiedInterpolants, 27010 SizeOfPredicates, 17 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 34/49 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...