./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.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/cstrchr-alloca_true-valid-memsafety_true-termination.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 b77e20ecf2782844251cc1f0f4840606114db633 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:07:27,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:07:27,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:07:27,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:07:27,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:07:27,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:07:27,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:07:27,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:07:27,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:07:27,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:07:27,833 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:07:27,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:07:27,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:07:27,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:07:27,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:07:27,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:07:27,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:07:27,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:07:27,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:07:27,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:07:27,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:07:27,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:07:27,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:07:27,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:07:27,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:07:27,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:07:27,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:07:27,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:07:27,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:07:27,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:07:27,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:07:27,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:07:27,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:07:27,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:07:27,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:07:27,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:07:27,859 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:27,879 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:07:27,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:07:27,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:07:27,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:07:27,881 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:07:27,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:07:27,881 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:07:27,882 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:07:27,884 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:07:27,884 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:07:27,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:07:27,885 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:07:27,885 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:07:27,885 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:07:27,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:07:27,885 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:07:27,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:07:27,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:07:27,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:07:27,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:07:27,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:27,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:07:27,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:07:27,889 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:07:27,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:07:27,890 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 -> b77e20ecf2782844251cc1f0f4840606114db633 [2019-01-14 18:07:27,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:07:27,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:07:27,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:07:27,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:07:27,959 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:07:27,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:28,013 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ac70faf/b1eb5de60e9f49e2a4fb156ae4a79316/FLAG427edc6cd [2019-01-14 18:07:28,482 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:07:28,483 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:28,499 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ac70faf/b1eb5de60e9f49e2a4fb156ae4a79316/FLAG427edc6cd [2019-01-14 18:07:28,876 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68ac70faf/b1eb5de60e9f49e2a4fb156ae4a79316 [2019-01-14 18:07:28,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:07:28,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:07:28,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:28,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:07:28,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:07:28,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:28" (1/1) ... [2019-01-14 18:07:28,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73293ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:28, skipping insertion in model container [2019-01-14 18:07:28,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:28" (1/1) ... [2019-01-14 18:07:28,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:07:28,936 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:07:29,227 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:29,239 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:07:29,390 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:29,447 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:07:29,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:29 WrapperNode [2019-01-14 18:07:29,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:29,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:07:29,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:07:29,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:07:29,464 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:29" (1/1) ... [2019-01-14 18:07:29,465 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:29" (1/1) ... [2019-01-14 18:07:29,480 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:29" (1/1) ... [2019-01-14 18:07:29,481 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:29" (1/1) ... [2019-01-14 18:07:29,495 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:29" (1/1) ... [2019-01-14 18:07:29,500 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:29" (1/1) ... [2019-01-14 18:07:29,503 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:29" (1/1) ... [2019-01-14 18:07:29,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:07:29,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:07:29,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:07:29,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:07:29,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:29" (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:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:07:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:07:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:07:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:07:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrchr [2019-01-14 18:07:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:07:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:07:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:07:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:07:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:07:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:07:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:07:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:07:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:07:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:07:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:07:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:07:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:07:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:07:29,590 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:07:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:07:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:07:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:07:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:07:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:07:29,591 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:07:29,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:07:29,594 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:07:29,594 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:07:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:07:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:07:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:07:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:07:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:07:29,595 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:07:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:07:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:07:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:07:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:07:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:07:29,596 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:07:29,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:07:29,599 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:07:29,599 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:07:29,600 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:07:29,600 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:07:29,600 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:07:29,600 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:07:29,600 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:07:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:07:29,602 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:07:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:07:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:07:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:07:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:07:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:07:29,604 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:07:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:07:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:07:29,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:07:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:07:29,607 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:07:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:07:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:07:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:07:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:07:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:07:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:07:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:07:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:07:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:07:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:07:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure cstrchr [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:07:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:07:30,285 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:07:30,285 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 18:07:30,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:30 BoogieIcfgContainer [2019-01-14 18:07:30,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:07:30,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:07:30,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:07:30,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:07:30,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:07:28" (1/3) ... [2019-01-14 18:07:30,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d50542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:30, skipping insertion in model container [2019-01-14 18:07:30,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:29" (2/3) ... [2019-01-14 18:07:30,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d50542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:30, skipping insertion in model container [2019-01-14 18:07:30,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:30" (3/3) ... [2019-01-14 18:07:30,307 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:30,340 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:07:30,361 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-14 18:07:30,402 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-14 18:07:30,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:07:30,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:07:30,447 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:07:30,447 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:07:30,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:07:30,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:07:30,450 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:07:30,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:07:30,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:07:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-14 18:07:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:07:30,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:30,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:30,492 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1038358777, now seen corresponding path program 1 times [2019-01-14 18:07:30,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:30,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:30,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:30,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:30,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:30,730 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:30,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:30,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:30,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:30,751 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-14 18:07:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:30,899 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-14 18:07:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:30,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 18:07:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:30,911 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:07:30,911 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 18:07:30,913 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:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 18:07:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-14 18:07:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:07:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-14 18:07:30,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 9 [2019-01-14 18:07:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:30,952 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-14 18:07:30,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-14 18:07:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:07:30,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:30,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:30,954 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1038358776, now seen corresponding path program 1 times [2019-01-14 18:07:30,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:30,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:31,047 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:31,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:31,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:31,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:31,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:31,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:31,051 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2019-01-14 18:07:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:31,112 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-14 18:07:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:31,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-14 18:07:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:31,115 INFO L225 Difference]: With dead ends: 32 [2019-01-14 18:07:31,116 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 18:07:31,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 18:07:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 18:07:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 18:07:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-14 18:07:31,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 9 [2019-01-14 18:07:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:31,123 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-14 18:07:31,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-14 18:07:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:07:31,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:31,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:31,125 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash -197265354, now seen corresponding path program 1 times [2019-01-14 18:07:31,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:31,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:31,230 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:31,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:31,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:07:31,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:07:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:07:31,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:07:31,233 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2019-01-14 18:07:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:31,505 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-14 18:07:31,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:07:31,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 18:07:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:31,507 INFO L225 Difference]: With dead ends: 29 [2019-01-14 18:07:31,507 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 18:07:31,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 18:07:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 18:07:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 18:07:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-14 18:07:31,512 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 13 [2019-01-14 18:07:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:31,513 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-14 18:07:31,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:07:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-14 18:07:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:07:31,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:31,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:31,514 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:31,515 INFO L82 PathProgramCache]: Analyzing trace with hash -197265353, now seen corresponding path program 1 times [2019-01-14 18:07:31,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:31,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:31,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:31,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:31,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:31,689 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:31,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:31,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:07:31,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:07:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:07:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:07:31,692 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2019-01-14 18:07:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:31,945 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-01-14 18:07:31,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:31,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 18:07:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:31,948 INFO L225 Difference]: With dead ends: 40 [2019-01-14 18:07:31,948 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 18:07:31,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 18:07:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-14 18:07:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 18:07:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-14 18:07:31,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2019-01-14 18:07:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:31,957 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-14 18:07:31,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:07:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-14 18:07:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 18:07:31,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:31,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:31,959 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash 930134862, now seen corresponding path program 1 times [2019-01-14 18:07:31,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:31,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:31,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:32,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:32,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:32,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:32,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:32,021 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2019-01-14 18:07:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:32,045 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-01-14 18:07:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:32,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 18:07:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:32,048 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:07:32,048 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 18:07:32,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 18:07:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 18:07:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 18:07:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-14 18:07:32,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 17 [2019-01-14 18:07:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:32,057 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 18:07:32,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-01-14 18:07:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:32,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:32,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:32,058 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:32,059 INFO L82 PathProgramCache]: Analyzing trace with hash 500544395, now seen corresponding path program 1 times [2019-01-14 18:07:32,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:32,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:32,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:32,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:07:32,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:07:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:07:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:32,578 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 9 states. [2019-01-14 18:07:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:32,875 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-01-14 18:07:32,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:07:32,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-01-14 18:07:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:32,878 INFO L225 Difference]: With dead ends: 55 [2019-01-14 18:07:32,878 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 18:07:32,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:07:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 18:07:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-14 18:07:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 18:07:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-01-14 18:07:32,886 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 19 [2019-01-14 18:07:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:32,886 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-01-14 18:07:32,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:07:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-01-14 18:07:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:32,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:32,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:32,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash -86261619, now seen corresponding path program 1 times [2019-01-14 18:07:32,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:32,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:32,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:32,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:33,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:33,463 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:33,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:33,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:33,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:07:33,559 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 11 treesize of output 10 [2019-01-14 18:07:33,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:33,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:33,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:07:33,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 18:07:33,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-14 18:07:33,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:07:33,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:33,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:33,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:33,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-14 18:07:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:34,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:34,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-01-14 18:07:34,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 18:07:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 18:07:34,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-01-14 18:07:34,090 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 17 states. [2019-01-14 18:07:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:36,214 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-01-14 18:07:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:07:36,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-01-14 18:07:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:36,217 INFO L225 Difference]: With dead ends: 73 [2019-01-14 18:07:36,217 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 18:07:36,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-01-14 18:07:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 18:07:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2019-01-14 18:07:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 18:07:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-01-14 18:07:36,225 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 19 [2019-01-14 18:07:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:36,225 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-01-14 18:07:36,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 18:07:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-01-14 18:07:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:07:36,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:36,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:36,227 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1178535163, now seen corresponding path program 1 times [2019-01-14 18:07:36,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:36,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:36,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:36,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:36,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:36,301 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:36,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:36,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:36,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:36,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:36,302 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 4 states. [2019-01-14 18:07:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:36,396 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-01-14 18:07:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:36,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-14 18:07:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:36,398 INFO L225 Difference]: With dead ends: 57 [2019-01-14 18:07:36,399 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 18:07:36,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 18:07:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-14 18:07:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 18:07:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-14 18:07:36,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2019-01-14 18:07:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:36,403 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-14 18:07:36,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-14 18:07:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:07:36,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:36,405 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:36,405 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 18:07:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1638571167, now seen corresponding path program 2 times [2019-01-14 18:07:36,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:36,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:36,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:36,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:36,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:36,902 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:36,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:07:36,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:07:36,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:07:36,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:36,968 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:36,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:36,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:36,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 18:07:37,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:07:37,011 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 13 treesize of output 12 [2019-01-14 18:07:37,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:37,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:37,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:37,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-14 18:07:37,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 18:07:37,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:07:37,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:37,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:37,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:37,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2019-01-14 18:07:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:37,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-14 18:07:37,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 18:07:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 18:07:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-01-14 18:07:37,436 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-14 18:07:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,599 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-14 18:07:38,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:07:38,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-01-14 18:07:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,601 INFO L225 Difference]: With dead ends: 33 [2019-01-14 18:07:38,601 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:07:38,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2019-01-14 18:07:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:07:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:07:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:07:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:07:38,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-01-14 18:07:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,604 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:07:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 18:07:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:07:38,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:07:38,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:07:38 BoogieIcfgContainer [2019-01-14 18:07:38,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:07:38,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:07:38,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:07:38,610 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:07:38,611 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:30" (3/4) ... [2019-01-14 18:07:38,614 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:07:38,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrchr [2019-01-14 18:07:38,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:07:38,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:07:38,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:07:38,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:07:38,626 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-14 18:07:38,626 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 18:07:38,627 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 18:07:38,674 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:07:38,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:07:38,675 INFO L168 Benchmark]: Toolchain (without parser) took 9796.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 954.0 MB in the beginning and 992.8 MB in the end (delta: -38.7 MB). Peak memory consumption was 182.5 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:38,677 INFO L168 Benchmark]: CDTParser took 0.18 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:38,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:38,682 INFO L168 Benchmark]: Boogie Preprocessor took 61.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:07:38,683 INFO L168 Benchmark]: RCFGBuilder took 777.11 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:38,683 INFO L168 Benchmark]: TraceAbstraction took 8319.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 153.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:38,684 INFO L168 Benchmark]: Witness Printer took 64.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:38,690 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.18 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 567.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 777.11 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8319.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 153.0 MB. Max. memory is 11.5 GB. * Witness Printer took 64.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 992.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 8.1s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 372 SDslu, 658 SDs, 0 SdLazy, 666 SolverSat, 62 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=7, 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, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 180 ConstructedInterpolants, 12 QuantifiedInterpolants, 26856 SizeOfPredicates, 14 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 3/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...