./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/960521-1_1_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-ext-properties/960521-1_1_false-valid-free.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 0aa8863ece82a1c5b6b3bdfef0291d9b5e9dd95e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:53:09,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:53:09,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:53:09,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:53:09,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:53:09,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:53:09,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:53:09,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:53:09,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:53:09,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:53:09,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:53:09,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:53:09,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:53:09,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:53:09,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:53:09,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:53:09,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:53:09,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:53:09,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:53:09,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:53:09,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:53:09,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:53:09,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:53:09,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:53:09,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:53:09,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:53:09,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:53:09,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:53:09,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:53:09,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:53:09,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:53:09,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:53:09,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:53:09,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:53:09,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:53:09,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:53:09,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:53:09,227 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:53:09,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:53:09,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:53:09,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:53:09,228 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:53:09,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:53:09,231 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:53:09,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:53:09,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:53:09,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:53:09,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:53:09,233 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:53:09,233 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:53:09,233 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:53:09,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:53:09,233 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:53:09,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:53:09,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:53:09,234 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:53:09,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:53:09,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:53:09,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:53:09,235 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:53:09,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:53:09,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:53:09,235 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 -> 0aa8863ece82a1c5b6b3bdfef0291d9b5e9dd95e [2019-01-14 18:53:09,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:53:09,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:53:09,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:53:09,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:53:09,295 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:53:09,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/960521-1_1_false-valid-free.i [2019-01-14 18:53:09,357 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351e93771/3512c6ce99604d86bcabfd5f310b0789/FLAG2443a925d [2019-01-14 18:53:09,910 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:53:09,911 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/960521-1_1_false-valid-free.i [2019-01-14 18:53:09,928 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351e93771/3512c6ce99604d86bcabfd5f310b0789/FLAG2443a925d [2019-01-14 18:53:10,142 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351e93771/3512c6ce99604d86bcabfd5f310b0789 [2019-01-14 18:53:10,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:53:10,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:53:10,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:10,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:53:10,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:53:10,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d754c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10, skipping insertion in model container [2019-01-14 18:53:10,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:53:10,208 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:53:10,493 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:10,506 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:53:10,622 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:53:10,677 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:53:10,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10 WrapperNode [2019-01-14 18:53:10,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:53:10,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:53:10,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:53:10,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:53:10,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... [2019-01-14 18:53:10,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:53:10,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:53:10,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:53:10,747 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:53:10,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:53:10,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:53:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:53:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-14 18:53:10,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:53:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 18:53:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:53:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:53:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:53:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:53:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:53:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:53:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:53:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:53:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:53:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:53:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:53:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:53:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:53:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:53:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:53:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:53:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:53:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:53:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:53:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:53:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:53:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:53:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:53:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:53:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:53:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:53:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:53:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:53:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:53:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:53:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:53:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:53:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:53:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:53:10,820 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:53:10,821 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:53:10,821 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:53:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:53:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:53:10,824 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:53:10,824 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:53:10,824 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:53:10,824 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:53:10,824 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:53:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:53:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:53:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:53:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:53:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:53:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:53:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:53:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:53:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:53:10,828 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:53:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:53:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:53:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:53:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:53:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:53:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:53:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:53:10,831 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:53:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:53:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:53:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:53:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:53:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:53:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:53:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:53:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-14 18:53:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:53:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:53:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:53:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:53:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:53:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:53:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:53:11,596 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:53:11,596 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 18:53:11,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:11 BoogieIcfgContainer [2019-01-14 18:53:11,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:53:11,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:53:11,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:53:11,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:53:11,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:53:10" (1/3) ... [2019-01-14 18:53:11,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a65b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:11, skipping insertion in model container [2019-01-14 18:53:11,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:53:10" (2/3) ... [2019-01-14 18:53:11,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a65b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:53:11, skipping insertion in model container [2019-01-14 18:53:11,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:11" (3/3) ... [2019-01-14 18:53:11,610 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2019-01-14 18:53:11,621 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:53:11,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-14 18:53:11,643 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-14 18:53:11,670 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:53:11,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:53:11,671 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:53:11,671 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:53:11,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:53:11,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:53:11,672 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:53:11,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:53:11,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:53:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-01-14 18:53:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 18:53:11,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:11,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:11,710 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1714143759, now seen corresponding path program 1 times [2019-01-14 18:53:11,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:11,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:11,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:11,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:11,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:11,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:11,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:53:11,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 18:53:11,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 18:53:11,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 18:53:11,878 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2019-01-14 18:53:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:11,895 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-14 18:53:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 18:53:11,898 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-14 18:53:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:11,909 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:53:11,909 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 18:53:11,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 18:53:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 18:53:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-14 18:53:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-14 18:53:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-01-14 18:53:11,959 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 9 [2019-01-14 18:53:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:11,959 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-01-14 18:53:11,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 18:53:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-01-14 18:53:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:53:11,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:11,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:11,963 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1599063324, now seen corresponding path program 1 times [2019-01-14 18:53:11,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:11,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:53:12,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:53:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:53:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:12,162 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 3 states. [2019-01-14 18:53:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:12,353 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-14 18:53:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:12,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:53:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:12,355 INFO L225 Difference]: With dead ends: 58 [2019-01-14 18:53:12,355 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 18:53:12,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 18:53:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-14 18:53:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 18:53:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-01-14 18:53:12,364 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 10 [2019-01-14 18:53:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:12,365 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-01-14 18:53:12,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:53:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-01-14 18:53:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:53:12,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:12,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:12,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:12,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1599063323, now seen corresponding path program 1 times [2019-01-14 18:53:12,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:12,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:12,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:53:12,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:53:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:53:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:53:12,505 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 4 states. [2019-01-14 18:53:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:12,674 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-01-14 18:53:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:53:12,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:53:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:12,676 INFO L225 Difference]: With dead ends: 57 [2019-01-14 18:53:12,676 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 18:53:12,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 18:53:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-14 18:53:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 18:53:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-01-14 18:53:12,683 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 10 [2019-01-14 18:53:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:12,683 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-01-14 18:53:12,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:53:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-01-14 18:53:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:53:12,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:12,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:12,685 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash -888768851, now seen corresponding path program 1 times [2019-01-14 18:53:12,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:12,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:12,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:12,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:12,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:12,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:53:12,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:53:12,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:53:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:53:12,803 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 4 states. [2019-01-14 18:53:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:12,871 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-14 18:53:12,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:12,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 18:53:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:12,873 INFO L225 Difference]: With dead ends: 54 [2019-01-14 18:53:12,873 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 18:53:12,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:53:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 18:53:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-14 18:53:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 18:53:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-14 18:53:12,880 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 15 [2019-01-14 18:53:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:12,880 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-14 18:53:12,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:53:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-14 18:53:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:53:12,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:12,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:12,883 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash -888768850, now seen corresponding path program 1 times [2019-01-14 18:53:12,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:12,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:13,327 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-14 18:53:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:13,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:13,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:13,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:13,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:13,501 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2019-01-14 18:53:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:13,703 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-01-14 18:53:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:13,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 18:53:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:13,708 INFO L225 Difference]: With dead ends: 62 [2019-01-14 18:53:13,708 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 18:53:13,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 18:53:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-01-14 18:53:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 18:53:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-14 18:53:13,715 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 15 [2019-01-14 18:53:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:13,716 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-14 18:53:13,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-14 18:53:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:53:13,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:13,717 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:13,718 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:13,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1160580254, now seen corresponding path program 1 times [2019-01-14 18:53:13,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:13,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:13,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:13,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:13,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:53:13,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:53:13,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:13,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 18:53:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-01-14 18:53:14,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:53:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:53:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:14,035 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 8 states. [2019-01-14 18:53:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:14,265 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-01-14 18:53:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:14,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-14 18:53:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:14,268 INFO L225 Difference]: With dead ends: 96 [2019-01-14 18:53:14,268 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 18:53:14,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:53:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 18:53:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2019-01-14 18:53:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 18:53:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-14 18:53:14,276 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 18 [2019-01-14 18:53:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:14,276 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-14 18:53:14,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:53:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-14 18:53:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:53:14,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:14,277 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:14,278 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1498114627, now seen corresponding path program 1 times [2019-01-14 18:53:14,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:14,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 18:53:14,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:53:14,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:53:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:14,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:53:14,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:53:14,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:14,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 18:53:14,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2019-01-14 18:53:14,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:53:14,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:53:14,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 18:53:14,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 [2019-01-14 18:53:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:53:14,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:53:14,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-01-14 18:53:14,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:53:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:53:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:53:14,968 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 11 states. [2019-01-14 18:53:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:15,968 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-01-14 18:53:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:53:15,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-14 18:53:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:15,971 INFO L225 Difference]: With dead ends: 111 [2019-01-14 18:53:15,971 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 18:53:15,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-14 18:53:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 18:53:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2019-01-14 18:53:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 18:53:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-14 18:53:15,980 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 20 [2019-01-14 18:53:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:15,981 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-14 18:53:15,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:53:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-14 18:53:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:53:15,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:15,982 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-14 18:53:15,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1786077017, now seen corresponding path program 1 times [2019-01-14 18:53:15,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:15,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:15,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:15,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:53:16,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:53:16,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:53:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:53:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:53:16,217 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 4 states. [2019-01-14 18:53:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:16,280 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 18:53:16,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:53:16,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-14 18:53:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:16,283 INFO L225 Difference]: With dead ends: 69 [2019-01-14 18:53:16,284 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 18:53:16,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:53:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 18:53:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 18:53:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 18:53:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-14 18:53:16,292 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 22 [2019-01-14 18:53:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:16,292 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-14 18:53:16,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:53:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-14 18:53:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:53:16,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:16,294 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-14 18:53:16,295 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1786077016, now seen corresponding path program 1 times [2019-01-14 18:53:16,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:16,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:53:16,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:16,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:53:16,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:53:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:53:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:53:16,421 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-01-14 18:53:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:16,586 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-01-14 18:53:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:53:16,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-14 18:53:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:16,590 INFO L225 Difference]: With dead ends: 57 [2019-01-14 18:53:16,591 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 18:53:16,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:53:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 18:53:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-14 18:53:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 18:53:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-01-14 18:53:16,596 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 22 [2019-01-14 18:53:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:16,597 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-01-14 18:53:16,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:53:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-01-14 18:53:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:53:16,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:16,600 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-14 18:53:16,600 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:16,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1329427684, now seen corresponding path program 1 times [2019-01-14 18:53:16,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:16,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:16,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:16,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:16,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:53:16,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:16,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:53:16,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:53:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:53:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:16,721 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2019-01-14 18:53:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:16,811 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-14 18:53:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:53:16,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 18:53:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:16,813 INFO L225 Difference]: With dead ends: 55 [2019-01-14 18:53:16,813 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 18:53:16,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:53:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 18:53:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-14 18:53:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 18:53:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-01-14 18:53:16,831 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2019-01-14 18:53:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:16,831 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-01-14 18:53:16,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:53:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-01-14 18:53:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 18:53:16,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:16,838 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:53:16,839 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 305698516, now seen corresponding path program 1 times [2019-01-14 18:53:16,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:16,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:53:17,364 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 18:53:17,751 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 18:53:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 18:53:17,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:53:17,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:53:17,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:53:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:53:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:53:17,776 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 8 states. [2019-01-14 18:53:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:53:18,020 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-14 18:53:18,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:53:18,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-14 18:53:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:53:18,023 INFO L225 Difference]: With dead ends: 69 [2019-01-14 18:53:18,023 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 18:53:18,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:53:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 18:53:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2019-01-14 18:53:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 18:53:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-01-14 18:53:18,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2019-01-14 18:53:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:53:18,030 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-01-14 18:53:18,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:53:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-01-14 18:53:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:53:18,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:53:18,031 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, 1] [2019-01-14 18:53:18,033 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 18:53:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:53:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1974719878, now seen corresponding path program 1 times [2019-01-14 18:53:18,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:53:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:53:18,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:18,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:53:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:53:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:53:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 18:53:18,090 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 18:53:18,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:53:18 BoogieIcfgContainer [2019-01-14 18:53:18,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:53:18,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:53:18,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:53:18,135 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:53:18,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:53:11" (3/4) ... [2019-01-14 18:53:18,139 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 18:53:18,199 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:53:18,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:53:18,200 INFO L168 Benchmark]: Toolchain (without parser) took 8055.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:18,202 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:18,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:18,204 INFO L168 Benchmark]: Boogie Preprocessor took 65.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:18,205 INFO L168 Benchmark]: RCFGBuilder took 854.36 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: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-01-14 18:53:18,206 INFO L168 Benchmark]: TraceAbstraction took 6534.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -77.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:18,207 INFO L168 Benchmark]: Witness Printer took 64.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:53:18,211 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.19 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 531.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.46 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 854.36 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: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6534.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -77.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 64.98 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.plugins.generator.traceabstraction: - CounterExampleResult [Line: 643]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=7, \old(a)=9, \old(b)=5, \old(b)=10, \old(n)=8, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] a = malloc(n * sizeof(*a)) [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, b++={1:0}, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] [L638] *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, b++={1:0}, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=0, n=1] [L626] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=0, n=1] [L627] COND FALSE !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, i=0, n=1] [L639] RET foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] [L640] b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, b[-1]=0, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] [L640] COND FALSE !(b[-1]) [L643] free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] [L643] free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] [L643] free(a) [L643] free(b) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={2:0}, b={1:4}, malloc(n * sizeof(*a))={2:0}, malloc(n * sizeof(*b))={1:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 21 error locations. UNSAFE Result, 6.4s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 496 SDtfs, 742 SDslu, 608 SDs, 0 SdLazy, 637 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 9 QuantifiedInterpolants, 22874 SizeOfPredicates, 7 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 18/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...