./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.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/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.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 86b203c3a804c103d90401bd32cfcff28939b920 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:32:23,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:32:23,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:32:23,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:32:23,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:32:23,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:32:23,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:32:23,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:32:23,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:32:23,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:32:23,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:32:23,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:32:23,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:32:23,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:32:23,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:32:23,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:32:23,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:32:23,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:32:23,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:32:23,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:32:23,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:32:23,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:32:23,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:32:23,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:32:23,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:32:23,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:32:23,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:32:23,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:32:23,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:32:23,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:32:23,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:32:23,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:32:23,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:32:23,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:32:23,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:32:23,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:32:23,941 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:32:23,956 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:32:23,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:32:23,957 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:32:23,957 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:32:23,957 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:32:23,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:32:23,958 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:32:23,958 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:32:23,958 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:32:23,958 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:32:23,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:32:23,960 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:32:23,960 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:32:23,960 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:32:23,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:32:23,961 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:32:23,961 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:32:23,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:32:23,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:32:23,962 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:32:23,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:32:23,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:32:23,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:32:23,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:32:23,963 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:32:23,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:32:23,963 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 -> 86b203c3a804c103d90401bd32cfcff28939b920 [2019-01-14 00:32:24,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:32:24,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:32:24,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:32:24,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:32:24,031 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:32:24,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.i [2019-01-14 00:32:24,094 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6dbf764/f06133e72ebf42ae8f039d1f3fa63ebd/FLAG2218e7a85 [2019-01-14 00:32:24,554 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:32:24,559 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/sll_shallow_copy_true-valid-memsafety.i [2019-01-14 00:32:24,580 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6dbf764/f06133e72ebf42ae8f039d1f3fa63ebd/FLAG2218e7a85 [2019-01-14 00:32:24,870 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6dbf764/f06133e72ebf42ae8f039d1f3fa63ebd [2019-01-14 00:32:24,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:32:24,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:32:24,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:32:24,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:32:24,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:32:24,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:32:24" (1/1) ... [2019-01-14 00:32:24,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac1ea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:24, skipping insertion in model container [2019-01-14 00:32:24,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:32:24" (1/1) ... [2019-01-14 00:32:24,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:32:24,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:32:25,332 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:32:25,342 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:32:25,387 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:32:25,518 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:32:25,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25 WrapperNode [2019-01-14 00:32:25,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:32:25,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:32:25,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:32:25,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:32:25,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (1/1) ... [2019-01-14 00:32:25,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:32:25,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:32:25,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:32:25,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:32:25,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (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 00:32:25,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:32:25,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:32:25,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:32:25,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:32:25,636 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:32:25,637 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2019-01-14 00:32:25,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:32:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:32:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:32:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:32:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:32:25,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:32:25,638 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:32:25,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:32:25,638 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:32:25,638 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:32:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:32:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:32:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:32:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:32:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:32:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:32:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:32:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:32:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:32:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:32:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:32:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:32:25,642 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:32:25,642 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:32:25,642 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:32:25,642 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:32:25,643 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:32:25,643 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:32:25,643 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:32:25,643 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:32:25,643 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:32:25,644 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:32:25,645 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:32:25,646 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:32:25,646 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:32:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:32:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:32:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:32:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:32:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:32:25,647 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:32:25,648 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:32:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:32:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:32:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:32:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:32:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:32:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:32:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:32:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:32:25,651 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:32:25,652 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:32:25,653 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:32:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:32:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:32:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:32:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:32:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:32:25,656 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:32:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:32:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:32:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:32:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:32:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:32:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:32:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:32:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:32:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:32:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:32:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:32:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:32:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:32:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:32:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:32:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:32:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:32:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:32:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:32:25,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:32:26,043 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:32:26,354 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:32:26,355 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-14 00:32:26,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:32:26 BoogieIcfgContainer [2019-01-14 00:32:26,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:32:26,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:32:26,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:32:26,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:32:26,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:32:24" (1/3) ... [2019-01-14 00:32:26,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152111c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:32:26, skipping insertion in model container [2019-01-14 00:32:26,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:32:25" (2/3) ... [2019-01-14 00:32:26,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152111c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:32:26, skipping insertion in model container [2019-01-14 00:32:26,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:32:26" (3/3) ... [2019-01-14 00:32:26,363 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy_true-valid-memsafety.i [2019-01-14 00:32:26,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:32:26,379 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-14 00:32:26,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-14 00:32:26,417 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:32:26,418 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:32:26,418 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:32:26,419 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:32:26,419 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:32:26,419 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:32:26,420 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:32:26,420 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:32:26,420 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:32:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-01-14 00:32:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:32:26,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:26,447 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:32:26,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 975324898, now seen corresponding path program 1 times [2019-01-14 00:32:26,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:26,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:26,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:26,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:32:27,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:32:27,078 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 00:32:27,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:27,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:32:27,169 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 00:32:27,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:27,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:27,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 00:32:27,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:27,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:27,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 00:32:27,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:27,292 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 00:32:27,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-01-14 00:32:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:32:27,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:32:27,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-14 00:32:27,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:32:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:32:27,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:32:27,425 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 10 states. [2019-01-14 00:32:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:29,162 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-14 00:32:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:32:29,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-01-14 00:32:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:29,171 INFO L225 Difference]: With dead ends: 43 [2019-01-14 00:32:29,171 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 00:32:29,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:32:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 00:32:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-14 00:32:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 00:32:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-14 00:32:29,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 19 [2019-01-14 00:32:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:29,213 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-14 00:32:29,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:32:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-14 00:32:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:32:29,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:29,215 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:32:29,216 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash 975324899, now seen corresponding path program 1 times [2019-01-14 00:32:29,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:29,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:29,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:29,607 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 00:32:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:32:29,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:32:29,680 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 00:32:29,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:29,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:32:29,725 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 00:32:29,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:29,738 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 00:32:29,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:29,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:29,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-14 00:32:29,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:29,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:29,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:32:29,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:29,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 00:32:29,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:29,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:32:29,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2019-01-14 00:32:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:32:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:32:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-01-14 00:32:30,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:32:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:32:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:32:30,062 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2019-01-14 00:32:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:30,465 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-14 00:32:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:32:30,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-14 00:32:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:30,468 INFO L225 Difference]: With dead ends: 32 [2019-01-14 00:32:30,468 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 00:32:30,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:32:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 00:32:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 00:32:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 00:32:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-14 00:32:30,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2019-01-14 00:32:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:30,477 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-14 00:32:30,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:32:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-14 00:32:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 00:32:30,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:30,480 INFO L402 BasicCegarLoop]: trace histogram [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 00:32:30,480 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1236254071, now seen corresponding path program 1 times [2019-01-14 00:32:30,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:30,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:30,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:30,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:32:30,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:32:30,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:32:30,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:30,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:32:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:32:30,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:32:30,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 00:32:30,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:32:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:32:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:32:30,674 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 6 states. [2019-01-14 00:32:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:30,766 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-14 00:32:30,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:32:30,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-14 00:32:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:30,768 INFO L225 Difference]: With dead ends: 31 [2019-01-14 00:32:30,768 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 00:32:30,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:32:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 00:32:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-14 00:32:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 00:32:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-14 00:32:30,775 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-01-14 00:32:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:30,775 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-14 00:32:30,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:32:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-14 00:32:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 00:32:30,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:30,777 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:32:30,777 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1665781067, now seen corresponding path program 1 times [2019-01-14 00:32:30,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:30,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:30,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:32:30,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:32:30,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 00:32:30,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:32:30,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:32:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:32:30,937 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2019-01-14 00:32:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:31,057 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-14 00:32:31,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:32:31,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-01-14 00:32:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:31,061 INFO L225 Difference]: With dead ends: 30 [2019-01-14 00:32:31,061 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 00:32:31,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:32:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 00:32:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 00:32:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 00:32:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-14 00:32:31,066 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-01-14 00:32:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:31,067 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-14 00:32:31,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:32:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-14 00:32:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:32:31,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:31,068 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 00:32:31,068 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 99605601, now seen corresponding path program 1 times [2019-01-14 00:32:31,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:31,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:31,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:32:31,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:32:31,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 00:32:31,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:32:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:32:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:32:31,302 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2019-01-14 00:32:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:31,467 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-14 00:32:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:32:31,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-14 00:32:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:31,470 INFO L225 Difference]: With dead ends: 29 [2019-01-14 00:32:31,470 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 00:32:31,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:32:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 00:32:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 00:32:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 00:32:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-14 00:32:31,476 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 30 [2019-01-14 00:32:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:31,476 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-14 00:32:31,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:32:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-14 00:32:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:32:31,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:31,478 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 00:32:31,478 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1207193587, now seen corresponding path program 1 times [2019-01-14 00:32:31,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:31,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:32:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:32:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 00:32:31,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 00:32:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 00:32:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-14 00:32:31,796 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-01-14 00:32:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:32,277 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-14 00:32:32,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:32:32,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-01-14 00:32:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:32,280 INFO L225 Difference]: With dead ends: 28 [2019-01-14 00:32:32,280 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 00:32:32,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:32:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 00:32:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 00:32:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 00:32:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-14 00:32:32,285 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 31 [2019-01-14 00:32:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:32,285 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-14 00:32:32,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 00:32:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-14 00:32:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 00:32:32,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:32,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:32:32,287 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:32:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1231704548, now seen corresponding path program 1 times [2019-01-14 00:32:32,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:32,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:32:33,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:32:33,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:32:33,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:33,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:32:33,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2019-01-14 00:32:33,600 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 11 treesize of output 8 [2019-01-14 00:32:33,604 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 8 treesize of output 7 [2019-01-14 00:32:33,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:35 [2019-01-14 00:32:33,691 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 50 treesize of output 39 [2019-01-14 00:32:33,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-14 00:32:33,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-01-14 00:32:33,742 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 42 treesize of output 34 [2019-01-14 00:32:33,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 23 [2019-01-14 00:32:33,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-01-14 00:32:33,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:33,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-14 00:32:33,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 00:32:33,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,917 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 00:32:33,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-01-14 00:32:33,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:33,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:33,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 00:32:33,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:34,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:32:34,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2019-01-14 00:32:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 00:32:34,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:32:34,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 21 [2019-01-14 00:32:34,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 00:32:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 00:32:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:32:34,066 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 22 states. [2019-01-14 00:32:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:34,977 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-14 00:32:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 00:32:34,977 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-01-14 00:32:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:34,978 INFO L225 Difference]: With dead ends: 27 [2019-01-14 00:32:34,978 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:32:34,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2019-01-14 00:32:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:32:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:32:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:32:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:32:34,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-14 00:32:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:34,980 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:32:34,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 00:32:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:32:34,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:32:34,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:32:34 BoogieIcfgContainer [2019-01-14 00:32:34,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:32:34,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:32:34,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:32:34,986 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:32:34,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:32:26" (3/4) ... [2019-01-14 00:32:34,990 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:32:34,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:32:34,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:32:34,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:32:34,997 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:32:34,997 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:32:34,997 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_node [2019-01-14 00:32:35,002 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 00:32:35,002 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 00:32:35,002 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:32:35,048 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:32:35,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:32:35,049 INFO L168 Benchmark]: Toolchain (without parser) took 10175.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 951.3 MB in the beginning and 939.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 216.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:35,050 INFO L168 Benchmark]: CDTParser took 0.16 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 00:32:35,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:35,052 INFO L168 Benchmark]: Boogie Preprocessor took 57.25 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:35,052 INFO L168 Benchmark]: RCFGBuilder took 779.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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:35,053 INFO L168 Benchmark]: TraceAbstraction took 8628.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 939.5 MB in the end (delta: 139.5 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:35,054 INFO L168 Benchmark]: Witness Printer took 62.67 ms. Allocated memory is still 1.2 GB. Free memory is still 939.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:32:35,057 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.16 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 643.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.25 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 779.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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8628.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 939.5 MB in the end (delta: 139.5 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. * Witness Printer took 62.67 ms. Allocated memory is still 1.2 GB. Free memory is still 939.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 573]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 574]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 55 locations, 15 error locations. SAFE Result, 8.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 139 SDslu, 555 SDs, 0 SdLazy, 1055 SolverSat, 53 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 273 ConstructedInterpolants, 14 QuantifiedInterpolants, 58659 SizeOfPredicates, 20 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 27/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...