./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/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-2e94e6a [2019-01-01 17:58:37,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:58:37,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:58:37,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:58:37,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:58:37,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:58:37,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:58:37,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:58:37,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:58:37,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:58:37,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:58:37,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:58:37,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:58:37,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:58:37,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:58:37,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:58:37,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:58:37,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:58:37,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:58:37,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:58:37,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:58:37,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:58:37,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:58:37,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:58:37,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:58:37,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:58:37,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:58:37,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:58:37,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:58:37,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:58:37,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:58:37,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:58:37,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:58:37,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:58:37,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:58:37,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:58:37,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:58:37,432 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:58:37,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:58:37,435 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:58:37,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:58:37,436 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:58:37,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:58:37,436 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:58:37,437 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:58:37,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:58:37,438 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:58:37,438 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:58:37,438 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:58:37,438 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:58:37,439 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:58:37,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:58:37,440 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:58:37,440 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:58:37,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:58:37,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:58:37,440 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:58:37,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:58:37,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:58:37,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:58:37,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:58:37,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:58:37,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:58:37,445 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-01 17:58:37,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:58:37,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:58:37,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:58:37,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:58:37,536 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:58:37,537 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-01 17:58:37,591 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1af65bd/022a9765f0614633b4e281ba720ba673/FLAG6c6fe71f5 [2019-01-01 17:58:38,058 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:58:38,059 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/960521-1_1_false-valid-free.i [2019-01-01 17:58:38,072 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1af65bd/022a9765f0614633b4e281ba720ba673/FLAG6c6fe71f5 [2019-01-01 17:58:38,374 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1af65bd/022a9765f0614633b4e281ba720ba673 [2019-01-01 17:58:38,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:58:38,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:58:38,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:58:38,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:58:38,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:58:38,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:58:38" (1/1) ... [2019-01-01 17:58:38,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0b07a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:38, skipping insertion in model container [2019-01-01 17:58:38,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:58:38" (1/1) ... [2019-01-01 17:58:38,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:58:38,447 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:58:38,854 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:58:38,872 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:58:38,940 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:58:39,015 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:58:39,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39 WrapperNode [2019-01-01 17:58:39,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:58:39,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:58:39,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:58:39,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:58:39,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... [2019-01-01 17:58:39,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:58:39,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:58:39,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:58:39,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:58:39,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:58:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:58:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:58:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-01 17:58:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:58:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:58:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:58:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:58:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:58:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:58:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:58:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:58:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:58:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:58:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:58:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:58:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:58:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:58:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:58:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:58:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:58:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:58:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:58:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:58:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:58:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:58:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:58:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:58:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:58:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:58:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:58:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:58:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:58:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:58:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:58:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:58:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:58:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:58:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:58:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:58:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:58:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:58:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:58:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:58:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:58:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:58:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:58:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:58:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:58:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:58:40,038 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:58:40,038 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-01 17:58:40,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:58:40 BoogieIcfgContainer [2019-01-01 17:58:40,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:58:40,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:58:40,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:58:40,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:58:40,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:58:38" (1/3) ... [2019-01-01 17:58:40,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edbf2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:58:40, skipping insertion in model container [2019-01-01 17:58:40,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:58:39" (2/3) ... [2019-01-01 17:58:40,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edbf2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:58:40, skipping insertion in model container [2019-01-01 17:58:40,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:58:40" (3/3) ... [2019-01-01 17:58:40,047 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2019-01-01 17:58:40,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:58:40,065 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-01-01 17:58:40,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-01-01 17:58:40,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:58:40,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:58:40,109 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:58:40,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:58:40,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:58:40,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:58:40,110 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:58:40,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:58:40,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:58:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-01-01 17:58:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:58:40,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:40,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:40,157 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1714143759, now seen corresponding path program 1 times [2019-01-01 17:58:40,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:40,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:40,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:58:40,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-01 17:58:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 17:58:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 17:58:40,341 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2019-01-01 17:58:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:40,360 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-01 17:58:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 17:58:40,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-01 17:58:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:40,373 INFO L225 Difference]: With dead ends: 62 [2019-01-01 17:58:40,373 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 17:58:40,375 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-01 17:58:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 17:58:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-01 17:58:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 17:58:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-01-01 17:58:40,417 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 9 [2019-01-01 17:58:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:40,418 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-01-01 17:58:40,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-01 17:58:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-01-01 17:58:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:58:40,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:40,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:40,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:40,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1599063324, now seen corresponding path program 1 times [2019-01-01 17:58:40,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:40,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:40,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:40,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:40,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:40,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:40,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:58:40,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:58:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:58:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:58:40,546 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 3 states. [2019-01-01 17:58:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:40,815 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-01 17:58:40,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:58:40,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:58:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:40,817 INFO L225 Difference]: With dead ends: 58 [2019-01-01 17:58:40,817 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 17:58:40,818 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-01 17:58:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 17:58:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-01 17:58:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 17:58:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-01-01 17:58:40,826 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 10 [2019-01-01 17:58:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:40,826 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-01-01 17:58:40,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:58:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-01-01 17:58:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:58:40,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:40,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:40,828 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1599063323, now seen corresponding path program 1 times [2019-01-01 17:58:40,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:40,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:40,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:40,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:40,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:40,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:58:40,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:58:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:58:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:58:40,970 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 4 states. [2019-01-01 17:58:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:41,205 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-01-01 17:58:41,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:58:41,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:58:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:41,208 INFO L225 Difference]: With dead ends: 57 [2019-01-01 17:58:41,208 INFO L226 Difference]: Without dead ends: 57 [2019-01-01 17:58:41,208 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-01 17:58:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-01 17:58:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-01 17:58:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 17:58:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-01-01 17:58:41,216 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 10 [2019-01-01 17:58:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:41,216 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-01-01 17:58:41,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:58:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-01-01 17:58:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:58:41,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:41,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:41,218 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash -888768851, now seen corresponding path program 1 times [2019-01-01 17:58:41,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:41,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:41,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:41,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:41,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:58:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:58:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:58:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:58:41,355 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 4 states. [2019-01-01 17:58:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:41,446 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-01 17:58:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:58:41,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-01 17:58:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:41,448 INFO L225 Difference]: With dead ends: 54 [2019-01-01 17:58:41,448 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 17:58:41,448 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-01 17:58:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 17:58:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-01 17:58:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 17:58:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-01 17:58:41,457 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 15 [2019-01-01 17:58:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:41,457 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-01 17:58:41,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:58:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-01 17:58:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:58:41,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:41,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:41,460 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -888768850, now seen corresponding path program 1 times [2019-01-01 17:58:41,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:41,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:41,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:41,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:41,837 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 17:58:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:58:41,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:41,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:58:41,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:58:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:58:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:58:41,858 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2019-01-01 17:58:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:42,318 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-01-01 17:58:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:58:42,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-01 17:58:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:42,322 INFO L225 Difference]: With dead ends: 62 [2019-01-01 17:58:42,323 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 17:58:42,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:58:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 17:58:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-01-01 17:58:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 17:58:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-01 17:58:42,331 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 15 [2019-01-01 17:58:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:42,331 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-01 17:58:42,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:58:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-01 17:58:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:58:42,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:42,333 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:42,334 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:42,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1160580254, now seen corresponding path program 1 times [2019-01-01 17:58:42,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:42,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:42,467 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-01 17:58:42,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:58:42,468 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-01 17:58:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:42,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:58:42,648 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-01 17:58:42,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 17:58:42,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-01-01 17:58:42,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:58:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:58:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:58:42,674 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 8 states. [2019-01-01 17:58:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:42,953 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-01-01 17:58:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:58:42,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-01 17:58:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:42,956 INFO L225 Difference]: With dead ends: 96 [2019-01-01 17:58:42,956 INFO L226 Difference]: Without dead ends: 96 [2019-01-01 17:58:42,957 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-01 17:58:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-01 17:58:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2019-01-01 17:58:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 17:58:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-01 17:58:42,964 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 18 [2019-01-01 17:58:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:42,964 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-01 17:58:42,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:58:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-01 17:58:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:58:42,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:42,966 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-01 17:58:42,966 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:42,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1498114627, now seen corresponding path program 1 times [2019-01-01 17:58:42,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:42,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:42,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:43,191 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-01 17:58:43,301 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-01 17:58:43,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:58:43,302 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-01 17:58:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:43,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:58:43,464 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-01 17:58:43,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:58:43,488 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-01 17:58:43,494 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-01 17:58:43,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:58:43,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:58:43,529 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-01 17:58:43,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 [2019-01-01 17:58:43,719 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-01 17:58:43,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:58:43,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-01-01 17:58:43,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:58:43,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:58:43,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:58:43,751 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 11 states. [2019-01-01 17:58:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:44,811 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-01-01 17:58:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:58:44,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-01 17:58:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:44,813 INFO L225 Difference]: With dead ends: 111 [2019-01-01 17:58:44,813 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 17:58:44,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:58:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 17:58:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2019-01-01 17:58:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 17:58:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-01-01 17:58:44,822 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 20 [2019-01-01 17:58:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:44,822 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-01-01 17:58:44,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:58:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-01-01 17:58:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:58:44,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:44,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:44,823 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1786077017, now seen corresponding path program 1 times [2019-01-01 17:58:44,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:44,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:44,911 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-01 17:58:44,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:44,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:58:44,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:58:44,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:58:44,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:58:44,912 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 4 states. [2019-01-01 17:58:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:44,974 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-01 17:58:44,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:58:44,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-01 17:58:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:44,977 INFO L225 Difference]: With dead ends: 69 [2019-01-01 17:58:44,977 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 17:58:44,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:58:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 17:58:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-01 17:58:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 17:58:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-01 17:58:44,984 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 22 [2019-01-01 17:58:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:44,985 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-01 17:58:44,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:58:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-01 17:58:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:58:44,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:44,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:44,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1786077016, now seen corresponding path program 1 times [2019-01-01 17:58:44,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:45,223 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-01 17:58:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:45,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:58:45,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:58:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:58:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:58:45,226 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-01-01 17:58:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:45,383 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-01-01 17:58:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:58:45,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-01 17:58:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:45,386 INFO L225 Difference]: With dead ends: 57 [2019-01-01 17:58:45,386 INFO L226 Difference]: Without dead ends: 57 [2019-01-01 17:58:45,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:58:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-01 17:58:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-01 17:58:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-01 17:58:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-01-01 17:58:45,392 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 22 [2019-01-01 17:58:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:45,393 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-01-01 17:58:45,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:58:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-01-01 17:58:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:58:45,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:45,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:58:45,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1329427684, now seen corresponding path program 1 times [2019-01-01 17:58:45,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:45,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:45,494 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-01 17:58:45,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:45,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:58:45,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:58:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:58:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:58:45,496 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2019-01-01 17:58:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:45,602 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-01 17:58:45,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:58:45,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-01 17:58:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:45,604 INFO L225 Difference]: With dead ends: 55 [2019-01-01 17:58:45,605 INFO L226 Difference]: Without dead ends: 55 [2019-01-01 17:58:45,606 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-01 17:58:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-01 17:58:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-01 17:58:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 17:58:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-01-01 17:58:45,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2019-01-01 17:58:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:45,620 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-01-01 17:58:45,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:58:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-01-01 17:58:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:58:45,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:45,625 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-01 17:58:45,626 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash 305698516, now seen corresponding path program 1 times [2019-01-01 17:58:45,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:45,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:58:46,153 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-01 17:58:46,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:58:46,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:58:46,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:58:46,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:58:46,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:58:46,155 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 8 states. [2019-01-01 17:58:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:58:46,367 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-01 17:58:46,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:58:46,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-01 17:58:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:58:46,369 INFO L225 Difference]: With dead ends: 69 [2019-01-01 17:58:46,369 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 17:58:46,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:58:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 17:58:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2019-01-01 17:58:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 17:58:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-01-01 17:58:46,373 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2019-01-01 17:58:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:58:46,374 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-01-01 17:58:46,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:58:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-01-01 17:58:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:58:46,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:58:46,375 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-01 17:58:46,375 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:58:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:58:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1974719878, now seen corresponding path program 1 times [2019-01-01 17:58:46,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:58:46,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:58:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:46,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:58:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:58:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:58:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:58:46,437 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:58:46,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:58:46 BoogieIcfgContainer [2019-01-01 17:58:46,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:58:46,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:58:46,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:58:46,497 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:58:46,498 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:58:40" (3/4) ... [2019-01-01 17:58:46,501 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 17:58:46,576 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:58:46,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:58:46,577 INFO L168 Benchmark]: Toolchain (without parser) took 8198.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:58:46,578 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:58:46,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.99 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-01 17:58:46,580 INFO L168 Benchmark]: Boogie Preprocessor took 134.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:58:46,581 INFO L168 Benchmark]: RCFGBuilder took 885.60 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: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:58:46,582 INFO L168 Benchmark]: TraceAbstraction took 6457.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:58:46,582 INFO L168 Benchmark]: Witness Printer took 78.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:58:46,587 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 637.99 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 885.60 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: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6457.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 78.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. 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)=10, \old(b)=5, \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.3s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 496 SDtfs, 742 SDslu, 608 SDs, 0 SdLazy, 637 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s 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...