./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/list-ext-properties/960521-1_1-3.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 1ea2dc862d4e5ac3143824817093a58b58ef1480 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:36:40,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:36:40,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:36:40,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:36:40,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:36:40,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:36:40,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:36:40,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:36:40,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:36:40,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:36:40,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:36:40,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:36:40,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:36:40,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:36:40,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:36:40,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:36:40,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:36:40,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:36:40,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:36:40,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:36:40,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:36:40,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:36:40,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:36:40,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:36:40,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:36:40,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:36:40,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:36:40,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:36:40,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:36:40,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:36:40,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:36:40,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:36:40,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:36:40,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:36:40,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:36:40,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:36:40,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:36:40,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:36:40,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:36:40,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:36:40,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:36:40,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:36:41,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:36:41,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:36:41,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:36:41,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:36:41,026 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:36:41,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:36:41,027 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:36:41,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:36:41,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:36:41,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:36:41,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:36:41,031 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:36:41,031 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:36:41,031 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:36:41,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:36:41,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:36:41,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:36:41,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:36:41,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:36:41,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:36:41,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:36:41,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:36:41,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:36:41,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:36:41,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:36:41,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:36:41,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:36:41,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 1ea2dc862d4e5ac3143824817093a58b58ef1480 [2019-11-28 02:36:41,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:36:41,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:36:41,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:36:41,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:36:41,373 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:36:41,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2019-11-28 02:36:41,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c079038e/d1b36311acb1423ea32434b065c3ae26/FLAGf65258174 [2019-11-28 02:36:41,953 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:36:41,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2019-11-28 02:36:41,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c079038e/d1b36311acb1423ea32434b065c3ae26/FLAGf65258174 [2019-11-28 02:36:42,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c079038e/d1b36311acb1423ea32434b065c3ae26 [2019-11-28 02:36:42,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:36:42,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:36:42,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:36:42,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:36:42,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:36:42,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57fa7dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42, skipping insertion in model container [2019-11-28 02:36:42,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:36:42,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:36:42,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:36:42,821 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:36:42,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:36:42,926 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:36:42,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42 WrapperNode [2019-11-28 02:36:42,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:36:42,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:36:42,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:36:42,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:36:42,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (1/1) ... [2019-11-28 02:36:42,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:36:42,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:36:42,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:36:42,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:36:42,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (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-11-28 02:36:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:36:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:36:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:36:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:36:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:36:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:36:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:36:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 02:36:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:36:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:36:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:36:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:36:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:36:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:36:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:36:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:36:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:36:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:36:43,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:36:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:36:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:36:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:36:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:36:43,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:36:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:36:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:36:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:36:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:36:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:36:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:36:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:36:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:36:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:36:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:36:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:36:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:36:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:36:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:36:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:36:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:36:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:36:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:36:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:36:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:36:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:36:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:36:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:36:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:36:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:36:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:36:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:36:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:36:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:36:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:36:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:36:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:36:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:36:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:36:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:36:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:36:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:36:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:36:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:36:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:36:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:36:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:36:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:36:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:36:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:36:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:36:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:36:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:36:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:36:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:36:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:36:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:36:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:36:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:36:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:36:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:36:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:36:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:36:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:36:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:36:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:36:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:36:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:36:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:36:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:36:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:36:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:36:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:36:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:36:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:36:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:36:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:36:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 02:36:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:36:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:36:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 02:36:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:36:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:36:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:36:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:36:43,638 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:36:43,639 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:36:43,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:36:43 BoogieIcfgContainer [2019-11-28 02:36:43,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:36:43,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:36:43,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:36:43,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:36:43,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:36:42" (1/3) ... [2019-11-28 02:36:43,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc57dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:36:43, skipping insertion in model container [2019-11-28 02:36:43,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:36:42" (2/3) ... [2019-11-28 02:36:43,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc57dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:36:43, skipping insertion in model container [2019-11-28 02:36:43,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:36:43" (3/3) ... [2019-11-28 02:36:43,650 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1-3.i [2019-11-28 02:36:43,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:36:43,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-11-28 02:36:43,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-11-28 02:36:43,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:36:43,697 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:36:43,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:36:43,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:36:43,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:36:43,699 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:36:43,699 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:36:43,699 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:36:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-28 02:36:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:36:43,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:43,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:43,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 583874427, now seen corresponding path program 1 times [2019-11-28 02:36:43,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:43,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134785298] [2019-11-28 02:36:43,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:43,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134785298] [2019-11-28 02:36:43,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:43,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:36:43,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75174943] [2019-11-28 02:36:43,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:36:43,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:36:43,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:36:43,988 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-11-28 02:36:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:44,151 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-28 02:36:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:36:44,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 02:36:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:44,163 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:36:44,164 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 02:36:44,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-28 02:36:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 02:36:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 02:36:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 02:36:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-28 02:36:44,209 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 9 [2019-11-28 02:36:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:44,209 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-28 02:36:44,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:36:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-28 02:36:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:36:44,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:44,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:44,212 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash 920023712, now seen corresponding path program 1 times [2019-11-28 02:36:44,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:44,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630528153] [2019-11-28 02:36:44,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:44,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630528153] [2019-11-28 02:36:44,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:44,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:36:44,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641923925] [2019-11-28 02:36:44,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:36:44,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:44,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:36:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:36:44,337 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2019-11-28 02:36:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:44,523 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-28 02:36:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:36:44,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:36:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:44,525 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:36:44,526 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 02:36:44,527 INFO L630 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-11-28 02:36:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 02:36:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-28 02:36:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 02:36:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-11-28 02:36:44,536 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 10 [2019-11-28 02:36:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:44,537 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-11-28 02:36:44,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:36:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-11-28 02:36:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:36:44,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:44,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:44,539 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 920023713, now seen corresponding path program 1 times [2019-11-28 02:36:44,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:44,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922870877] [2019-11-28 02:36:44,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:44,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922870877] [2019-11-28 02:36:44,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:44,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:36:44,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707628343] [2019-11-28 02:36:44,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:36:44,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:36:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:36:44,668 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2019-11-28 02:36:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:44,842 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 02:36:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:36:44,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 02:36:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:44,844 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:36:44,844 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:36:44,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:36:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:36:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-28 02:36:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 02:36:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-28 02:36:44,853 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 10 [2019-11-28 02:36:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:44,854 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-28 02:36:44,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:36:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-28 02:36:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:36:44,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:44,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:44,856 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 944956531, now seen corresponding path program 1 times [2019-11-28 02:36:44,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:44,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710412844] [2019-11-28 02:36:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:44,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710412844] [2019-11-28 02:36:44,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:44,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:36:44,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263400765] [2019-11-28 02:36:44,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:36:44,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:44,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:36:44,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:36:44,965 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 4 states. [2019-11-28 02:36:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:45,158 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-11-28 02:36:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:36:45,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:36:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:45,160 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:36:45,163 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:36:45,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:36:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:36:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 02:36:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:36:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 02:36:45,173 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 15 [2019-11-28 02:36:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:45,173 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 02:36:45,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:36:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 02:36:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:36:45,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:45,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:45,177 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash 944956532, now seen corresponding path program 1 times [2019-11-28 02:36:45,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:45,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724613494] [2019-11-28 02:36:45,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:45,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724613494] [2019-11-28 02:36:45,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:45,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:36:45,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761480539] [2019-11-28 02:36:45,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:36:45,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:36:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:36:45,400 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2019-11-28 02:36:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:45,684 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-11-28 02:36:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:36:45,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 02:36:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:45,689 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:36:45,689 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 02:36:45,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:36:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 02:36:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-11-28 02:36:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:36:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 02:36:45,697 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 15 [2019-11-28 02:36:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:45,697 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 02:36:45,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:36:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 02:36:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:36:45,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:45,698 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:45,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1984403550, now seen corresponding path program 1 times [2019-11-28 02:36:45,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:45,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320069685] [2019-11-28 02:36:45,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:45,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320069685] [2019-11-28 02:36:45,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81777208] [2019-11-28 02:36:45,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:36:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:45,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:36:45,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:36:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:45,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:36:45,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-28 02:36:45,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285758956] [2019-11-28 02:36:45,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:36:45,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:36:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:36:45,973 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 5 states. [2019-11-28 02:36:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:46,035 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-11-28 02:36:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:36:46,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 02:36:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:46,039 INFO L225 Difference]: With dead ends: 96 [2019-11-28 02:36:46,040 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 02:36:46,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:36:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 02:36:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2019-11-28 02:36:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 02:36:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-28 02:36:46,048 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 18 [2019-11-28 02:36:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:46,049 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-28 02:36:46,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:36:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-28 02:36:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:36:46,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:46,051 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:46,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:36:46,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash 813250499, now seen corresponding path program 1 times [2019-11-28 02:36:46,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:46,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556928708] [2019-11-28 02:36:46,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:36:46,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556928708] [2019-11-28 02:36:46,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879989616] [2019-11-28 02:36:46,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:36:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:46,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:36:46,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:36:46,609 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_14|], 1=[|v_#valid_32|]} [2019-11-28 02:36:46,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:36:46,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 15 [2019-11-28 02:36:46,628 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:46,642 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:46,649 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 02:36:46,649 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:46,670 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:46,675 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:36:46,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:33 [2019-11-28 02:36:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:46,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:36:46,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-28 02:36:46,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705374926] [2019-11-28 02:36:46,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:36:46,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:36:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:36:46,811 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 12 states. [2019-11-28 02:36:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:47,925 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-11-28 02:36:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:36:47,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-28 02:36:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:47,927 INFO L225 Difference]: With dead ends: 111 [2019-11-28 02:36:47,927 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 02:36:47,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:36:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 02:36:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2019-11-28 02:36:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 02:36:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-11-28 02:36:47,935 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 20 [2019-11-28 02:36:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:47,936 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-11-28 02:36:47,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:36:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-11-28 02:36:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:36:47,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:47,937 INFO L410 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] [2019-11-28 02:36:48,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:36:48,142 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1526472291, now seen corresponding path program 1 times [2019-11-28 02:36:48,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:48,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108841802] [2019-11-28 02:36:48,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:36:48,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108841802] [2019-11-28 02:36:48,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:48,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:36:48,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518911] [2019-11-28 02:36:48,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:36:48,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:36:48,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:36:48,199 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-11-28 02:36:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:48,357 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 02:36:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:36:48,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 02:36:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:48,359 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:36:48,359 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:36:48,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:36:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:36:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-28 02:36:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 02:36:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-28 02:36:48,366 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 22 [2019-11-28 02:36:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:48,367 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-28 02:36:48,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:36:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-28 02:36:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:36:48,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:48,368 INFO L410 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] [2019-11-28 02:36:48,369 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1526472292, now seen corresponding path program 1 times [2019-11-28 02:36:48,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:48,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043146376] [2019-11-28 02:36:48,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:36:48,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043146376] [2019-11-28 02:36:48,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:48,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:36:48,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518943128] [2019-11-28 02:36:48,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:36:48,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:36:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:36:48,490 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 8 states. [2019-11-28 02:36:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:48,711 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 02:36:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:36:48,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-28 02:36:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:48,713 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:36:48,713 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:36:48,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:36:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:36:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-28 02:36:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 02:36:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-28 02:36:48,719 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 22 [2019-11-28 02:36:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:48,720 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-28 02:36:48,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:36:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-28 02:36:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:36:48,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:48,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:48,722 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash 22294176, now seen corresponding path program 1 times [2019-11-28 02:36:48,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:48,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700761279] [2019-11-28 02:36:48,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:36:48,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700761279] [2019-11-28 02:36:48,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:48,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:36:48,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941219757] [2019-11-28 02:36:48,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:36:48,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:36:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:36:48,792 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2019-11-28 02:36:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:48,953 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-28 02:36:48,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:36:48,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 02:36:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:48,955 INFO L225 Difference]: With dead ends: 55 [2019-11-28 02:36:48,956 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 02:36:48,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:36:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 02:36:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 02:36:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 02:36:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-28 02:36:48,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2019-11-28 02:36:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:48,962 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-28 02:36:48,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:36:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-28 02:36:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:36:48,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:48,964 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:48,964 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:48,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1533450202, now seen corresponding path program 1 times [2019-11-28 02:36:48,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:48,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65191921] [2019-11-28 02:36:48,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:36:49,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65191921] [2019-11-28 02:36:49,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:36:49,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:36:49,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575270099] [2019-11-28 02:36:49,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:36:49,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:36:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:36:49,074 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 7 states. [2019-11-28 02:36:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:36:49,325 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 02:36:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:36:49,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 02:36:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:36:49,327 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:36:49,327 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:36:49,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:36:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:36:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-28 02:36:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 02:36:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-28 02:36:49,344 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2019-11-28 02:36:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:36:49,345 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-28 02:36:49,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:36:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-28 02:36:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:36:49,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:36:49,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:36:49,350 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:36:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:36:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash -50131134, now seen corresponding path program 1 times [2019-11-28 02:36:49,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:36:49,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772454200] [2019-11-28 02:36:49,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:36:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:49,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772454200] [2019-11-28 02:36:49,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307479261] [2019-11-28 02:36:49,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:36:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:36:49,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:36:49,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:36:49,813 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-28 02:36:49,814 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:49,821 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:49,821 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:36:49,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-28 02:36:49,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-28 02:36:49,845 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:49,852 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:49,852 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:36:49,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-28 02:36:49,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-28 02:36:49,879 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:49,883 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:49,883 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:36:49,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2019-11-28 02:36:54,402 WARN L192 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-28 02:36:54,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 02:36:54,421 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:54,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:54,432 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 02:36:54,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2019-11-28 02:36:54,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2019-11-28 02:36:54,460 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:36:54,463 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:36:54,464 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:36:54,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2019-11-28 02:36:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:36:54,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:36:54,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-28 02:36:54,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313784197] [2019-11-28 02:36:54,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 02:36:54,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:36:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:36:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=172, Unknown=5, NotChecked=0, Total=210 [2019-11-28 02:36:54,482 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 15 states. [2019-11-28 02:37:00,976 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-28 02:37:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:13,586 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-28 02:37:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:37:13,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-28 02:37:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:13,588 INFO L225 Difference]: With dead ends: 64 [2019-11-28 02:37:13,588 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 02:37:13,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=122, Invalid=521, Unknown=7, NotChecked=0, Total=650 [2019-11-28 02:37:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 02:37:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2019-11-28 02:37:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 02:37:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-11-28 02:37:13,592 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 27 [2019-11-28 02:37:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:13,593 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-11-28 02:37:13,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 02:37:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-11-28 02:37:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:37:13,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:13,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:13,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:13,800 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:37:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash -36770864, now seen corresponding path program 1 times [2019-11-28 02:37:13,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:13,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-28 02:37:13,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:37:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:37:13,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:37:13,860 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:37:13,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:13 BoogieIcfgContainer [2019-11-28 02:37:13,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:13,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:13,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:13,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:13,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:36:43" (3/4) ... [2019-11-28 02:37:13,906 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:37:13,975 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:13,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:13,977 INFO L168 Benchmark]: Toolchain (without parser) took 31719.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 146.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:13,977 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:13,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:13,978 INFO L168 Benchmark]: Boogie Preprocessor took 65.75 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:13,979 INFO L168 Benchmark]: RCFGBuilder took 646.77 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.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:13,979 INFO L168 Benchmark]: TraceAbstraction took 30259.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -58.6 MB). Peak memory consumption was 108.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:13,980 INFO L168 Benchmark]: Witness Printer took 73.30 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:13,983 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.75 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 646.77 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.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30259.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -58.6 MB). Peak memory consumption was 108.2 MB. Max. memory is 11.5 GB. * Witness Printer took 73.30 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 536]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L512] int *a, *b; [L513] int n; VAL [\old(a)=9, \old(a)=7, \old(b)=10, \old(b)=5, \old(n)=8, a={0:0}, b={0:0}, n=0] [L525] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L526] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L529] a = malloc(n * sizeof(*a)) [L530] b = malloc(n * sizeof(*b)) [L531] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, b++={-1:0}, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] [L531] *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, b++={-1:0}, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] [L532] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, n=1] [L517] int i; [L518] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=0, n=1] [L518] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=0, n=1] [L519] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=0, n=1] [L518] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=1, n=1] [L518] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=1, n=1] [L520] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=0, n=1] [L520] COND FALSE !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, i=0, n=1] [L532] RET foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] [L533] b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, b[-1]=0, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] [L533] COND FALSE !(b[-1]) [L536] free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] [L536] free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] [L536] free(a) [L536] free(b) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={3:0}, b={-1:4}, malloc(n * sizeof(*a))={3:0}, malloc(n * sizeof(*b))={-1:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 21 error locations. Result: UNSAFE, OverallTime: 30.1s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 437 SDtfs, 870 SDslu, 607 SDs, 0 SdLazy, 1390 SolverSat, 160 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 268 ConstructedInterpolants, 16 QuantifiedInterpolants, 38125 SizeOfPredicates, 17 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...