./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:27:17,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:27:17,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:27:17,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:27:17,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:27:17,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:27:17,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:27:17,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:27:17,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:27:17,191 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:27:17,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:27:17,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:27:17,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:27:17,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:27:17,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:27:17,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:27:17,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:27:17,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:27:17,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:27:17,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:27:17,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:27:17,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:27:17,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:27:17,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:27:17,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:27:17,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:27:17,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:27:17,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:27:17,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:27:17,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:27:17,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:27:17,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:27:17,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:27:17,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:27:17,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:27:17,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:27:17,228 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:27:17,248 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:27:17,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:27:17,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:27:17,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:27:17,251 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:27:17,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:27:17,251 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:27:17,251 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:27:17,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:27:17,254 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:27:17,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:27:17,254 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:27:17,254 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:27:17,254 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:27:17,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:27:17,255 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:27:17,255 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:27:17,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:27:17,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:27:17,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:27:17,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:27:17,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:27:17,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:27:17,259 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:27:17,259 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:27:17,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:27:17,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 [2019-01-01 17:27:17,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:27:17,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:27:17,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:27:17,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:27:17,353 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:27:17,355 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-01 17:27:17,419 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7703dc5a2/292a2946d89346d7922d32b828238b10/FLAG6172b4ba2 [2019-01-01 17:27:18,010 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:27:18,014 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-01 17:27:18,031 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7703dc5a2/292a2946d89346d7922d32b828238b10/FLAG6172b4ba2 [2019-01-01 17:27:18,239 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7703dc5a2/292a2946d89346d7922d32b828238b10 [2019-01-01 17:27:18,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:27:18,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:27:18,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:27:18,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:27:18,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:27:18,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b7d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18, skipping insertion in model container [2019-01-01 17:27:18,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:27:18,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:27:18,656 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:27:18,671 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:27:18,786 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:27:18,854 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:27:18,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18 WrapperNode [2019-01-01 17:27:18,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:27:18,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:27:18,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:27:18,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:27:18,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... [2019-01-01 17:27:18,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:27:18,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:27:18,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:27:18,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:27:18,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:27:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:27:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:27:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-01 17:27:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-01 17:27:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:27:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:27:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:27:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:27:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:27:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:27:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:27:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:27:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:27:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:27:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:27:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:27:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:27:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:27:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:27:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:27:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:27:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:27:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:27:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:27:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:27:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:27:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:27:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:27:19,038 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:27:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:27:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:27:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:27:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:27:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:27:19,039 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:27:19,040 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:27:19,041 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:27:19,042 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:27:19,042 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:27:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:27:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:27:19,045 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:27:19,047 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:27:19,048 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:27:19,049 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:27:19,050 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:27:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:27:19,052 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:27:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:27:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:27:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-01 17:27:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:27:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:27:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:27:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:27:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:27:19,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:27:19,819 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:27:19,820 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 17:27:19,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:27:19 BoogieIcfgContainer [2019-01-01 17:27:19,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:27:19,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:27:19,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:27:19,826 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:27:19,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:27:18" (1/3) ... [2019-01-01 17:27:19,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf16668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:27:19, skipping insertion in model container [2019-01-01 17:27:19,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:18" (2/3) ... [2019-01-01 17:27:19,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf16668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:27:19, skipping insertion in model container [2019-01-01 17:27:19,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:27:19" (3/3) ... [2019-01-01 17:27:19,830 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2019-01-01 17:27:19,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:27:19,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-01-01 17:27:19,880 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-01-01 17:27:19,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:27:19,907 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:27:19,907 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:27:19,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:27:19,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:27:19,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:27:19,908 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:27:19,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:27:19,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:27:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-01-01 17:27:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:27:19,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:19,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:19,941 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:19,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash 682489329, now seen corresponding path program 1 times [2019-01-01 17:27:19,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:20,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:20,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:20,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:20,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:27:20,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:27:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:27:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:20,272 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2019-01-01 17:27:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:20,692 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-01 17:27:20,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:27:20,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:27:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:20,704 INFO L225 Difference]: With dead ends: 52 [2019-01-01 17:27:20,704 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:27:20,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:27:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:27:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-01 17:27:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:27:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-01 17:27:20,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-01-01 17:27:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:20,744 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-01 17:27:20,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:27:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-01 17:27:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:27:20,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:20,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:20,746 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 682489330, now seen corresponding path program 1 times [2019-01-01 17:27:20,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:20,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:20,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:20,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:27:20,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:27:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:27:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:20,893 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-01-01 17:27:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:21,377 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-01 17:27:21,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:27:21,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:27:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:21,380 INFO L225 Difference]: With dead ends: 48 [2019-01-01 17:27:21,380 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 17:27:21,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:27:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 17:27:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-01 17:27:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 17:27:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-01 17:27:21,388 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-01-01 17:27:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:21,388 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-01 17:27:21,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:27:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-01 17:27:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:27:21,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:21,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:21,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1257751693, now seen corresponding path program 1 times [2019-01-01 17:27:21,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:21,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:21,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:21,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:27:21,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:27:21,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:27:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:27:21,586 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 6 states. [2019-01-01 17:27:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:21,811 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-01 17:27:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:27:21,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-01 17:27:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:21,814 INFO L225 Difference]: With dead ends: 47 [2019-01-01 17:27:21,814 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 17:27:21,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:27:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 17:27:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-01 17:27:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:27:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-01 17:27:21,821 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-01-01 17:27:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-01 17:27:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:27:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-01 17:27:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:27:21,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:21,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:21,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1615622142, now seen corresponding path program 1 times [2019-01-01 17:27:21,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:21,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:21,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:21,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:27:21,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:27:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:27:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:27:21,928 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2019-01-01 17:27:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:22,175 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-01 17:27:22,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:27:22,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-01 17:27:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:22,178 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:27:22,179 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:27:22,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:27:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:27:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-01-01 17:27:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:27:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-01 17:27:22,186 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2019-01-01 17:27:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:22,187 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-01 17:27:22,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:27:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-01 17:27:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:27:22,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:22,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:22,188 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1615622141, now seen corresponding path program 1 times [2019-01-01 17:27:22,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:22,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:22,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:22,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:22,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:27:22,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:27:22,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:27:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:27:22,420 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2019-01-01 17:27:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:22,634 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-01 17:27:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:27:22,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-01 17:27:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:22,637 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:27:22,637 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:27:22,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:27:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:27:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:27:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:27:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-01 17:27:22,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-01-01 17:27:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:22,643 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-01 17:27:22,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:27:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-01 17:27:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:27:22,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:22,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:22,645 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash -185755720, now seen corresponding path program 1 times [2019-01-01 17:27:22,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:22,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:27:22,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:27:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:27:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:27:22,867 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 10 states. [2019-01-01 17:27:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:23,096 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-01 17:27:23,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:27:23,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-01 17:27:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:23,099 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:27:23,099 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:27:23,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:27:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:27:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 17:27:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:27:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-01 17:27:23,106 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2019-01-01 17:27:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:23,106 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-01 17:27:23,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:27:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-01 17:27:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:27:23,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:23,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:23,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1463459962, now seen corresponding path program 1 times [2019-01-01 17:27:23,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:23,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:23,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:23,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:23,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:27:23,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:27:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:27:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:27:23,318 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2019-01-01 17:27:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:23,565 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-01 17:27:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:27:23,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-01 17:27:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:23,569 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:27:23,569 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:27:23,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:27:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:27:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 17:27:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:27:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-01 17:27:23,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2019-01-01 17:27:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:23,573 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-01 17:27:23,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:27:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-01 17:27:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:27:23,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:23,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:23,575 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1877381498, now seen corresponding path program 1 times [2019-01-01 17:27:23,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:23,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:27:23,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:27:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:27:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:27:23,790 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2019-01-01 17:27:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:24,372 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-01 17:27:24,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:27:24,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-01 17:27:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:24,377 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:27:24,377 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:27:24,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:27:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:27:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-01-01 17:27:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:27:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-01 17:27:24,382 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2019-01-01 17:27:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:24,383 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-01 17:27:24,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:27:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-01 17:27:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:27:24,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:24,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:24,385 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1930715640, now seen corresponding path program 1 times [2019-01-01 17:27:24,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:24,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:24,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:24,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:24,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:27:24,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:27:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:27:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:27:24,448 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 4 states. [2019-01-01 17:27:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:24,504 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-01 17:27:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:27:24,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-01 17:27:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:24,506 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:27:24,506 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:27:24,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:27:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-01 17:27:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 17:27:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-01 17:27:24,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 24 [2019-01-01 17:27:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:24,514 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-01 17:27:24,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:27:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-01 17:27:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:27:24,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:24,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:24,515 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash 277357372, now seen corresponding path program 1 times [2019-01-01 17:27:24,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:24,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:27:24,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:27:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:27:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:24,607 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 5 states. [2019-01-01 17:27:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:24,646 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-01 17:27:24,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:27:24,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-01 17:27:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:24,649 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:27:24,649 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:27:24,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:27:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-01 17:27:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:27:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-01 17:27:24,653 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2019-01-01 17:27:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:24,653 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-01 17:27:24,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:27:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-01 17:27:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:27:24,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:24,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:24,655 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-01 17:27:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash -36549633, now seen corresponding path program 1 times [2019-01-01 17:27:24,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:27:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:27:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:24,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:27:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:27:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:27:24,720 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:27:24,739 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-01 17:27:24,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:27:24 BoogieIcfgContainer [2019-01-01 17:27:24,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:27:24,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:27:24,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:27:24,770 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:27:24,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:27:19" (3/4) ... [2019-01-01 17:27:24,778 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 17:27:24,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:27:24,779 INFO L168 Benchmark]: Toolchain (without parser) took 6536.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:24,785 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:24,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:27:24,788 INFO L168 Benchmark]: Boogie Preprocessor took 99.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:24,789 INFO L168 Benchmark]: RCFGBuilder took 863.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:27:24,790 INFO L168 Benchmark]: TraceAbstraction took 4947.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -113.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:24,792 INFO L168 Benchmark]: Witness Printer took 9.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:24,798 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 863.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4947.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -113.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 639]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 639. Possible FailurePath: [L640] TData data; VAL [data={-3:0}] [L641] CALL alloc_data(&data) VAL [pdata={-3:0}] [L625] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={-3:0}, pdata={-3:0}] [L626] pdata->hi = malloc(24) VAL [malloc(16)={-1:0}, malloc(24)={1:0}, pdata={-3:0}, pdata={-3:0}] [L641] RET alloc_data(&data) VAL [data={-3:0}] [L642] CALL free_data(&data) VAL [data={-3:0}] [L630] EXPR data->lo VAL [data={-3:0}, data={-3:0}, data->lo={-1:0}] [L630] void *lo = data->lo; [L631] EXPR data->hi VAL [data={-3:0}, data={-3:0}, data->hi={1:0}, lo={-1:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L636] data->lo = (void *) 0 VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L637] data->hi = (void *) 0 VAL [data={-3:0}, data={-3:0}, hi={1:0}, lo={-1:0}] [L642] RET free_data(&data) VAL [data={-3:0}] [L643] return 0; [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 19 error locations. UNSAFE Result, 4.8s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 319 SDtfs, 282 SDslu, 818 SDs, 0 SdLazy, 831 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 12614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:27:27,186 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:27:27,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:27:27,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:27:27,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:27:27,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:27:27,205 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:27:27,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:27:27,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:27:27,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:27:27,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:27:27,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:27:27,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:27:27,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:27:27,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:27:27,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:27:27,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:27:27,219 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:27:27,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:27:27,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:27:27,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:27:27,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:27:27,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:27:27,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:27:27,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:27:27,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:27:27,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:27:27,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:27:27,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:27:27,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:27:27,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:27:27,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:27:27,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:27:27,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:27:27,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:27:27,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:27:27,240 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-01 17:27:27,256 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:27:27,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:27:27,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:27:27,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:27:27,258 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:27:27,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:27:27,259 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:27:27,259 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:27:27,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:27:27,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:27:27,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:27:27,260 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:27:27,260 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:27:27,261 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:27:27,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:27:27,261 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-01 17:27:27,261 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-01 17:27:27,261 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:27:27,262 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:27:27,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:27:27,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:27:27,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:27:27,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:27:27,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:27:27,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:27:27,265 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:27:27,265 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-01 17:27:27,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:27:27,266 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-01 17:27:27,266 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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 -> 3e29a7fa8491bc0edf7e32b974ff0e341ea18209 [2019-01-01 17:27:27,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:27:27,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:27:27,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:27:27,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:27:27,327 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:27:27,327 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-01 17:27:27,386 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ce2a562/37ad1ea2872c489c856f2c1c0de5e089/FLAG6afc167c0 [2019-01-01 17:27:27,912 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:27:27,913 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-0019_false-valid-memtrack_true-termination.i [2019-01-01 17:27:27,926 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ce2a562/37ad1ea2872c489c856f2c1c0de5e089/FLAG6afc167c0 [2019-01-01 17:27:28,206 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ce2a562/37ad1ea2872c489c856f2c1c0de5e089 [2019-01-01 17:27:28,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:27:28,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:27:28,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:27:28,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:27:28,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:27:28,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4327ac50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28, skipping insertion in model container [2019-01-01 17:27:28,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:27:28,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:27:28,637 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:27:28,648 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:27:28,786 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:27:28,844 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:27:28,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28 WrapperNode [2019-01-01 17:27:28,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:27:28,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:27:28,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:27:28,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:27:28,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... [2019-01-01 17:27:28,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:27:28,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:27:28,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:27:28,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:27:28,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:27:28,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:27:28,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:27:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-01-01 17:27:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-01-01 17:27:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:27:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:27:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:27:29,001 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:27:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:27:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:27:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:27:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:27:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:27:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:27:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:27:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:27:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:27:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:27:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:27:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:27:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:27:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:27:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:27:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:27:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:27:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:27:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:27:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:27:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:27:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:27:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:27:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:27:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:27:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:27:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:27:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:27:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:27:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:27:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:27:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:27:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:27:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:27:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:27:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:27:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:27:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:27:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:27:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:27:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:27:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:27:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:27:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:27:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:27:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:27:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:27:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:27:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:27:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:27:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:27:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:27:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:27:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:27:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:27:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:27:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:27:29,812 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:27:29,814 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-01 17:27:29,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:27:29 BoogieIcfgContainer [2019-01-01 17:27:29,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:27:29,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:27:29,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:27:29,820 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:27:29,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:27:28" (1/3) ... [2019-01-01 17:27:29,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc0a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:27:29, skipping insertion in model container [2019-01-01 17:27:29,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:27:28" (2/3) ... [2019-01-01 17:27:29,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc0a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:27:29, skipping insertion in model container [2019-01-01 17:27:29,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:27:29" (3/3) ... [2019-01-01 17:27:29,825 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2019-01-01 17:27:29,834 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:27:29,843 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-01-01 17:27:29,861 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-01-01 17:27:29,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:27:29,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:27:29,891 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:27:29,894 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:27:29,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:27:29,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:27:29,896 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:27:29,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:27:29,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:27:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-01-01 17:27:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:27:29,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:29,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:29,930 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 682489329, now seen corresponding path program 1 times [2019-01-01 17:27:29,942 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:29,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:29,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:30,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:30,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:27:30,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:30,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:30,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:27:30,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 17:27:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:30,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:27:30,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-01 17:27:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:30,275 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:30,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:30,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:27:30,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:27:30,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:27:30,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:30,300 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2019-01-01 17:27:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:30,672 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-01 17:27:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:27:30,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:27:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:30,684 INFO L225 Difference]: With dead ends: 52 [2019-01-01 17:27:30,684 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 17:27:30,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:27:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 17:27:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-01 17:27:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 17:27:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-01 17:27:30,727 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-01-01 17:27:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:30,728 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-01 17:27:30,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:27:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-01 17:27:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:27:30,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:30,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:30,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:30,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash 682489330, now seen corresponding path program 1 times [2019-01-01 17:27:30,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:30,732 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:30,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:30,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:27:30,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:30,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:27:30,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:31,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:31,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-01 17:27:31,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:31,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:31,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 17:27:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:31,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:31,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:31,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 17:27:31,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:31,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:27:31,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2019-01-01 17:27:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:31,764 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:31,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:31,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:27:31,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:27:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:27:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:27:31,774 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-01-01 17:27:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:32,353 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-01 17:27:32,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:27:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:32,355 INFO L225 Difference]: With dead ends: 48 [2019-01-01 17:27:32,355 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 17:27:32,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:27:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 17:27:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-01 17:27:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 17:27:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-01 17:27:32,364 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-01-01 17:27:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:32,364 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-01 17:27:32,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:27:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-01 17:27:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:27:32,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:32,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:32,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1257751693, now seen corresponding path program 1 times [2019-01-01 17:27:32,369 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:32,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:32,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:32,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:27:32,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:32,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 17:27:32,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:32,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:32,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-01 17:27:32,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 17:27:32,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:32,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 17:27:32,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:32,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:27:32,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-01 17:27:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2019-01-01 17:27:32,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:32,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:27:32,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 40 [2019-01-01 17:27:32,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:27:33,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 17:27:33,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:34 [2019-01-01 17:27:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:33,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:33,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:33,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:27:33,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:27:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:27:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:27:33,176 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 7 states. [2019-01-01 17:27:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:33,696 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-01 17:27:33,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:27:33,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-01 17:27:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:33,699 INFO L225 Difference]: With dead ends: 47 [2019-01-01 17:27:33,699 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 17:27:33,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:27:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 17:27:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-01 17:27:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:27:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-01 17:27:33,707 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-01-01 17:27:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:33,708 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-01 17:27:33,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:27:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-01 17:27:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:27:33,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:33,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:33,710 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1615622142, now seen corresponding path program 1 times [2019-01-01 17:27:33,711 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:33,711 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:33,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:33,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:33,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:27:33,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:33,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:33,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-01-01 17:27:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:33,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:33,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:33,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:27:33,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:27:33,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:27:33,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:27:33,862 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2019-01-01 17:27:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:34,178 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-01 17:27:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:27:34,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-01 17:27:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:34,181 INFO L225 Difference]: With dead ends: 51 [2019-01-01 17:27:34,181 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 17:27:34,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:27:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 17:27:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-01-01 17:27:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:27:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-01 17:27:34,191 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2019-01-01 17:27:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:34,191 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-01 17:27:34,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:27:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-01 17:27:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:27:34,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:34,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:34,194 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1615622141, now seen corresponding path program 1 times [2019-01-01 17:27:34,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:34,196 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:34,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:34,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:34,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:34,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:34,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:27:34,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:27:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:27:34,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:27:34,416 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2019-01-01 17:27:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:34,719 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-01 17:27:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:27:34,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-01 17:27:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:34,720 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:27:34,720 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:27:34,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:27:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:27:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:27:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:27:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-01 17:27:34,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-01-01 17:27:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:34,726 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-01 17:27:34,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:27:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-01 17:27:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 17:27:34,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:34,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:34,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash -185755720, now seen corresponding path program 1 times [2019-01-01 17:27:34,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:34,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:34,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:34,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:34,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 17:27:34,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 17:27:34,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:34,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:34,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:34,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 17:27:35,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 17:27:35,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 17:27:35,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:35,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:35,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:35,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 17:27:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:35,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:35,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:35,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 17:27:35,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:27:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:27:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:27:35,096 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-01-01 17:27:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:35,664 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-01 17:27:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:27:35,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-01 17:27:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:35,668 INFO L225 Difference]: With dead ends: 42 [2019-01-01 17:27:35,668 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 17:27:35,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:27:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 17:27:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-01 17:27:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:27:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-01 17:27:35,674 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 21 [2019-01-01 17:27:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:35,674 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-01 17:27:35,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:27:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-01 17:27:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:27:35,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:35,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:35,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1463459962, now seen corresponding path program 1 times [2019-01-01 17:27:35,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:35,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:35,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:35,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:35,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 17:27:35,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 17:27:35,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:35,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:35,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:35,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-01 17:27:36,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-01 17:27:36,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2019-01-01 17:27:36,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:36,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:36,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:36,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-01 17:27:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:36,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:36,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-01 17:27:36,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 17:27:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 17:27:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:27:36,296 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2019-01-01 17:27:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:37,910 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-01 17:27:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 17:27:37,912 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-01-01 17:27:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:37,913 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:27:37,914 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:27:37,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:27:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:27:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-01 17:27:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 17:27:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-01 17:27:37,918 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2019-01-01 17:27:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:37,919 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-01 17:27:37,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 17:27:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-01 17:27:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:27:37,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:37,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:37,920 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1877381498, now seen corresponding path program 1 times [2019-01-01 17:27:37,921 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:27:38,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:27:38,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:27:38,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2019-01-01 17:27:38,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 17:27:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 17:27:38,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-01 17:27:38,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 17:27:38,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-01 17:27:38,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:27:38,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:27:38,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-01-01 17:27:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:27:38,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:27:38,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:27:38,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 17:27:38,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 17:27:38,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 17:27:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:27:38,428 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 13 states. [2019-01-01 17:27:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:27:39,091 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-01 17:27:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:27:39,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-01 17:27:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:27:39,093 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:27:39,093 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:27:39,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-01-01 17:27:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:27:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-01 17:27:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:27:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-01 17:27:39,097 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2019-01-01 17:27:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:27:39,099 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-01 17:27:39,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 17:27:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-01 17:27:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:27:39,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:27:39,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:27:39,101 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION]=== [2019-01-01 17:27:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:27:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash -36549633, now seen corresponding path program 1 times [2019-01-01 17:27:39,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:27:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:27:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:27:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:27:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:27:39,406 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:27:39,426 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-01 17:27:39,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:27:39 BoogieIcfgContainer [2019-01-01 17:27:39,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:27:39,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:27:39,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:27:39,459 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:27:39,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:27:29" (3/4) ... [2019-01-01 17:27:39,468 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 17:27:39,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:27:39,469 INFO L168 Benchmark]: Toolchain (without parser) took 11258.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 954.0 MB in the beginning and 1.0 GB in the end (delta: -49.5 MB). Peak memory consumption was 163.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:27:39,472 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:39,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:27:39,474 INFO L168 Benchmark]: Boogie Preprocessor took 85.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:39,475 INFO L168 Benchmark]: RCFGBuilder took 882.42 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:27:39,477 INFO L168 Benchmark]: TraceAbstraction took 9643.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.4 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:27:39,482 INFO L168 Benchmark]: Witness Printer took 9.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:27:39,488 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 882.42 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9643.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.4 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * Witness Printer took 9.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 639]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 639. Possible FailurePath: [L640] TData data; VAL [data={-2147483648:0}] [L641] CALL alloc_data(&data) VAL [pdata={-2147483648:0}] [L625] pdata->lo = malloc(16) VAL [malloc(16)={3:0}, pdata={-2147483648:0}, pdata={-2147483648:0}] [L626] pdata->hi = malloc(24) VAL [malloc(16)={3:0}, malloc(24)={1:0}, pdata={-2147483648:0}, pdata={-2147483648:0}] [L641] RET alloc_data(&data) VAL [data={-2147483648:0}] [L642] CALL free_data(&data) VAL [data={-2147483648:0}] [L630] EXPR data->lo VAL [data={-2147483648:0}, data={-2147483648:0}, data->lo={3:0}] [L630] void *lo = data->lo; [L631] EXPR data->hi VAL [data={-2147483648:0}, data={-2147483648:0}, data->hi={1:0}, lo={3:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={-2147483648:0}, data={-2147483648:0}, hi={1:0}, lo={3:0}] [L636] data->lo = (void *) 0 VAL [data={-2147483648:0}, data={-2147483648:0}, hi={1:0}, lo={3:0}] [L637] data->hi = (void *) 0 VAL [data={-2147483648:0}, data={-2147483648:0}, hi={1:0}, lo={3:0}] [L642] RET free_data(&data) VAL [data={-2147483648:0}] [L643] return 0; [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 19 error locations. UNSAFE Result, 9.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 253 SDslu, 814 SDs, 0 SdLazy, 995 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 119 ConstructedInterpolants, 4 QuantifiedInterpolants, 13552 SizeOfPredicates, 54 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...