./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6439b1baef116d71fdff38c675a38b8a29c42257 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:19:30,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:19:30,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:19:30,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:19:30,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:19:30,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:19:30,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:19:30,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:19:30,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:19:30,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:19:30,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:19:30,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:19:30,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:19:30,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:19:30,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:19:30,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:19:30,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:19:30,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:19:30,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:19:30,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:19:30,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:19:30,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:19:30,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:19:30,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:19:30,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:19:30,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:19:30,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:19:30,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:19:30,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:19:30,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:19:30,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:19:30,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:19:30,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:19:30,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:19:30,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:19:30,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:19:30,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:19:30,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:19:30,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:19:30,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:19:30,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:19:30,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-07-29 01:19:30,497 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:19:30,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:19:30,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:19:30,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:19:30,500 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:19:30,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:19:30,500 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:19:30,501 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:19:30,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:19:30,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:19:30,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:19:30,503 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:19:30,503 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:19:30,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:19:30,504 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:19:30,504 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:19:30,504 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:19:30,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:19:30,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:19:30,505 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:19:30,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:19:30,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:19:30,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:19:30,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:19:30,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:19:30,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:19:30,506 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:19:30,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 6439b1baef116d71fdff38c675a38b8a29c42257 [2020-07-29 01:19:30,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:19:30,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:19:30,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:19:30,863 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:19:30,863 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:19:30,864 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2020-07-29 01:19:30,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999cb00f6/891ff4e5a8c44279a7d462531a7cc37a/FLAG93d45f44f [2020-07-29 01:19:31,458 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:19:31,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2020-07-29 01:19:31,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999cb00f6/891ff4e5a8c44279a7d462531a7cc37a/FLAG93d45f44f [2020-07-29 01:19:31,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/999cb00f6/891ff4e5a8c44279a7d462531a7cc37a [2020-07-29 01:19:31,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:19:31,762 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:19:31,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:31,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:19:31,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:19:31,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:31" (1/1) ... [2020-07-29 01:19:31,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439e3047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:31, skipping insertion in model container [2020-07-29 01:19:31,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:31" (1/1) ... [2020-07-29 01:19:31,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:19:31,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:19:32,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:32,229 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:19:32,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:32,374 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:19:32,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32 WrapperNode [2020-07-29 01:19:32,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:32,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:19:32,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:19:32,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:19:32,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (1/1) ... [2020-07-29 01:19:32,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:19:32,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:19:32,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:19:32,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:19:32,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (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 [2020-07-29 01:19:32,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:19:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:19:32,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:19:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:19:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:19:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:19:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:19:32,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:19:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:19:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:19:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:19:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:19:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:19:32,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:19:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:19:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:19:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:19:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:19:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:19:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:19:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:19:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:19:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:19:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:19:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:19:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:19:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:19:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:19:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:19:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:19:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:19:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:19:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:19:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:19:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:19:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:19:32,962 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:19:33,451 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:19:33,451 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:19:33,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:33 BoogieIcfgContainer [2020-07-29 01:19:33,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:19:33,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:19:33,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:19:33,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:19:33,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:19:31" (1/3) ... [2020-07-29 01:19:33,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edd682d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:33, skipping insertion in model container [2020-07-29 01:19:33,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:32" (2/3) ... [2020-07-29 01:19:33,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edd682d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:33, skipping insertion in model container [2020-07-29 01:19:33,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:33" (3/3) ... [2020-07-29 01:19:33,463 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-07-29 01:19:33,473 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:19:33,481 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-07-29 01:19:33,495 INFO L251 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-07-29 01:19:33,513 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:19:33,514 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:19:33,514 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:19:33,514 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:19:33,514 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:19:33,515 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:19:33,515 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:19:33,515 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:19:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-07-29 01:19:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:19:33,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:33,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:33,544 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -516857152, now seen corresponding path program 1 times [2020-07-29 01:19:33,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:33,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755151412] [2020-07-29 01:19:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:33,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:33,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-29 01:19:33,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-29 01:19:33,781 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {76#true} {76#true} #153#return; {76#true} is VALID [2020-07-29 01:19:33,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {76#true} call ULTIMATE.init(); {81#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:33,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-29 01:19:33,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-29 01:19:33,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {76#true} {76#true} #153#return; {76#true} is VALID [2020-07-29 01:19:33,787 INFO L263 TraceCheckUtils]: 4: Hoare triple {76#true} call #t~ret14 := main(); {76#true} is VALID [2020-07-29 01:19:33,788 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {76#true} is VALID [2020-07-29 01:19:33,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {76#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {76#true} is VALID [2020-07-29 01:19:33,788 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {76#true} is VALID [2020-07-29 01:19:33,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-29 01:19:33,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#false} assume !true; {77#false} is VALID [2020-07-29 01:19:33,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#false} assume !(1 == #valid[~p~0.base]); {77#false} is VALID [2020-07-29 01:19:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:33,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755151412] [2020-07-29 01:19:33,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:33,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:33,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306123885] [2020-07-29 01:19:33,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-29 01:19:33,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:33,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:19:33,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:33,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:19:33,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:19:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:19:33,850 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2020-07-29 01:19:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:34,205 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-07-29 01:19:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:19:34,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-29 01:19:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:19:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2020-07-29 01:19:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:19:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2020-07-29 01:19:34,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2020-07-29 01:19:34,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:34,402 INFO L225 Difference]: With dead ends: 73 [2020-07-29 01:19:34,402 INFO L226 Difference]: Without dead ends: 65 [2020-07-29 01:19:34,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:19:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-29 01:19:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-29 01:19:34,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:34,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2020-07-29 01:19:34,465 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-29 01:19:34,465 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-29 01:19:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:34,484 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-29 01:19:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-29 01:19:34,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:34,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:34,486 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-29 01:19:34,487 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-29 01:19:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:34,511 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-29 01:19:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-29 01:19:34,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:34,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:34,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:34,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-29 01:19:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-07-29 01:19:34,533 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 11 [2020-07-29 01:19:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:34,536 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-07-29 01:19:34,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:19:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-29 01:19:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:19:34,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:34,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:34,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:19:34,539 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -516882778, now seen corresponding path program 1 times [2020-07-29 01:19:34,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:34,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094687397] [2020-07-29 01:19:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:34,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:34,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {352#true} is VALID [2020-07-29 01:19:34,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2020-07-29 01:19:34,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #153#return; {352#true} is VALID [2020-07-29 01:19:34,678 INFO L263 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {359#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:34,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {352#true} is VALID [2020-07-29 01:19:34,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2020-07-29 01:19:34,679 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #153#return; {352#true} is VALID [2020-07-29 01:19:34,679 INFO L263 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret14 := main(); {352#true} is VALID [2020-07-29 01:19:34,681 INFO L280 TraceCheckUtils]: 5: Hoare triple {352#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {357#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:34,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {357#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {357#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:34,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {357#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {358#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:34,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {358#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {358#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:34,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {358#(= 1 (select |#valid| main_~p~0.base))} assume !!(0 != #t~nondet3);havoc #t~nondet3; {358#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:34,687 INFO L280 TraceCheckUtils]: 10: Hoare triple {358#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {353#false} is VALID [2020-07-29 01:19:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:34,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094687397] [2020-07-29 01:19:34,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:34,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:34,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626833003] [2020-07-29 01:19:34,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:34,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:34,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:34,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:34,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:34,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:34,712 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2020-07-29 01:19:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,192 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-29 01:19:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:35,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2020-07-29 01:19:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2020-07-29 01:19:35,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2020-07-29 01:19:35,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:35,334 INFO L225 Difference]: With dead ends: 72 [2020-07-29 01:19:35,334 INFO L226 Difference]: Without dead ends: 72 [2020-07-29 01:19:35,335 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-29 01:19:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2020-07-29 01:19:35,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:35,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 67 states. [2020-07-29 01:19:35,343 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 67 states. [2020-07-29 01:19:35,343 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 67 states. [2020-07-29 01:19:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,353 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-29 01:19:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2020-07-29 01:19:35,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:35,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:35,359 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 72 states. [2020-07-29 01:19:35,359 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 72 states. [2020-07-29 01:19:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,367 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-29 01:19:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2020-07-29 01:19:35,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:35,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:35,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:35,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-29 01:19:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2020-07-29 01:19:35,380 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 11 [2020-07-29 01:19:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:35,380 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2020-07-29 01:19:35,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2020-07-29 01:19:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:19:35,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:35,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:35,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:19:35,382 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash -516882777, now seen corresponding path program 1 times [2020-07-29 01:19:35,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:35,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725369258] [2020-07-29 01:19:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:35,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:35,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {654#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {647#true} is VALID [2020-07-29 01:19:35,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {647#true} assume true; {647#true} is VALID [2020-07-29 01:19:35,519 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {647#true} {647#true} #153#return; {647#true} is VALID [2020-07-29 01:19:35,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {654#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:35,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {654#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {647#true} is VALID [2020-07-29 01:19:35,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2020-07-29 01:19:35,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #153#return; {647#true} is VALID [2020-07-29 01:19:35,523 INFO L263 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret14 := main(); {647#true} is VALID [2020-07-29 01:19:35,524 INFO L280 TraceCheckUtils]: 5: Hoare triple {647#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {652#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:19:35,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {652#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {652#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:19:35,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {653#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:35,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {653#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {653#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:35,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {653#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3; {653#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:35,532 INFO L280 TraceCheckUtils]: 10: Hoare triple {653#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {648#false} is VALID [2020-07-29 01:19:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:35,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725369258] [2020-07-29 01:19:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:35,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688317878] [2020-07-29 01:19:35,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:35,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:35,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:35,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:35,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:35,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:35,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:35,554 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 5 states. [2020-07-29 01:19:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:36,142 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2020-07-29 01:19:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:36,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2020-07-29 01:19:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2020-07-29 01:19:36,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 109 transitions. [2020-07-29 01:19:36,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:36,322 INFO L225 Difference]: With dead ends: 92 [2020-07-29 01:19:36,322 INFO L226 Difference]: Without dead ends: 92 [2020-07-29 01:19:36,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-29 01:19:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2020-07-29 01:19:36,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:36,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 81 states. [2020-07-29 01:19:36,330 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 81 states. [2020-07-29 01:19:36,330 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 81 states. [2020-07-29 01:19:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:36,335 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2020-07-29 01:19:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2020-07-29 01:19:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:36,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:36,336 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 92 states. [2020-07-29 01:19:36,336 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 92 states. [2020-07-29 01:19:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:36,341 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2020-07-29 01:19:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2020-07-29 01:19:36,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:36,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:36,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:36,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-29 01:19:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-29 01:19:36,347 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 11 [2020-07-29 01:19:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:36,347 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-29 01:19:36,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-29 01:19:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:36,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:36,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:36,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:19:36,349 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:36,350 INFO L82 PathProgramCache]: Analyzing trace with hash -725497357, now seen corresponding path program 1 times [2020-07-29 01:19:36,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:36,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349099158] [2020-07-29 01:19:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:36,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:36,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {1025#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1016#true} is VALID [2020-07-29 01:19:36,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-29 01:19:36,453 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #153#return; {1016#true} is VALID [2020-07-29 01:19:36,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1025#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:36,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {1025#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1016#true} is VALID [2020-07-29 01:19:36,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {1016#true} assume true; {1016#true} is VALID [2020-07-29 01:19:36,455 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1016#true} {1016#true} #153#return; {1016#true} is VALID [2020-07-29 01:19:36,455 INFO L263 TraceCheckUtils]: 4: Hoare triple {1016#true} call #t~ret14 := main(); {1016#true} is VALID [2020-07-29 01:19:36,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {1016#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1016#true} is VALID [2020-07-29 01:19:36,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {1016#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1016#true} is VALID [2020-07-29 01:19:36,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {1016#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:36,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:36,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:36,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:36,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:36,469 INFO L280 TraceCheckUtils]: 12: Hoare triple {1021#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-3 {1022#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:36,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {1022#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1023#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:36,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {1023#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-3 {1024#(= 3 |main_#t~mem9|)} is VALID [2020-07-29 01:19:36,473 INFO L280 TraceCheckUtils]: 15: Hoare triple {1024#(= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9; {1017#false} is VALID [2020-07-29 01:19:36,473 INFO L280 TraceCheckUtils]: 16: Hoare triple {1017#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L542 {1017#false} is VALID [2020-07-29 01:19:36,474 INFO L280 TraceCheckUtils]: 17: Hoare triple {1017#false} ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1017#false} is VALID [2020-07-29 01:19:36,474 INFO L280 TraceCheckUtils]: 18: Hoare triple {1017#false} assume !(1 == #valid[~p~0.base]); {1017#false} is VALID [2020-07-29 01:19:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:36,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349099158] [2020-07-29 01:19:36,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:36,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:19:36,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243142618] [2020-07-29 01:19:36,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:36,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:36,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:36,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:36,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:36,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:36,504 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 7 states. [2020-07-29 01:19:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,249 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-29 01:19:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:37,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2020-07-29 01:19:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2020-07-29 01:19:37,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 126 transitions. [2020-07-29 01:19:37,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:37,422 INFO L225 Difference]: With dead ends: 120 [2020-07-29 01:19:37,423 INFO L226 Difference]: Without dead ends: 120 [2020-07-29 01:19:37,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-29 01:19:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2020-07-29 01:19:37,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:37,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 84 states. [2020-07-29 01:19:37,431 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 84 states. [2020-07-29 01:19:37,431 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 84 states. [2020-07-29 01:19:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,436 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-29 01:19:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-29 01:19:37,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:37,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:37,438 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 120 states. [2020-07-29 01:19:37,438 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 120 states. [2020-07-29 01:19:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,444 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-29 01:19:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-29 01:19:37,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:37,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:37,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:37,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-29 01:19:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2020-07-29 01:19:37,450 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 19 [2020-07-29 01:19:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:37,451 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2020-07-29 01:19:37,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2020-07-29 01:19:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:37,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:37,452 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:37,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:19:37,453 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 538341657, now seen corresponding path program 1 times [2020-07-29 01:19:37,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:37,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485008156] [2020-07-29 01:19:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:37,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:37,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1485#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1476#true} is VALID [2020-07-29 01:19:37,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {1476#true} assume true; {1476#true} is VALID [2020-07-29 01:19:37,578 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1476#true} {1476#true} #153#return; {1476#true} is VALID [2020-07-29 01:19:37,579 INFO L263 TraceCheckUtils]: 0: Hoare triple {1476#true} call ULTIMATE.init(); {1485#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:37,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {1485#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1476#true} is VALID [2020-07-29 01:19:37,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {1476#true} assume true; {1476#true} is VALID [2020-07-29 01:19:37,580 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1476#true} {1476#true} #153#return; {1476#true} is VALID [2020-07-29 01:19:37,580 INFO L263 TraceCheckUtils]: 4: Hoare triple {1476#true} call #t~ret14 := main(); {1476#true} is VALID [2020-07-29 01:19:37,580 INFO L280 TraceCheckUtils]: 5: Hoare triple {1476#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1476#true} is VALID [2020-07-29 01:19:37,580 INFO L280 TraceCheckUtils]: 6: Hoare triple {1476#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1476#true} is VALID [2020-07-29 01:19:37,581 INFO L280 TraceCheckUtils]: 7: Hoare triple {1476#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1476#true} is VALID [2020-07-29 01:19:37,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {1476#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1476#true} is VALID [2020-07-29 01:19:37,581 INFO L280 TraceCheckUtils]: 9: Hoare triple {1476#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1476#true} is VALID [2020-07-29 01:19:37,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {1476#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L526 {1476#true} is VALID [2020-07-29 01:19:37,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {1476#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1481#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:37,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {1481#(= 1 (select |#valid| main_~t~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1481#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:37,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {1481#(= 1 (select |#valid| main_~t~0.base))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L528-3 {1482#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:37,587 INFO L280 TraceCheckUtils]: 14: Hoare triple {1482#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529 {1483#(= (select |#valid| |main_#t~mem5.base|) 1)} is VALID [2020-07-29 01:19:37,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {1483#(= (select |#valid| |main_#t~mem5.base|) 1)} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1484#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:37,588 INFO L280 TraceCheckUtils]: 16: Hoare triple {1484#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1484#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:37,589 INFO L280 TraceCheckUtils]: 17: Hoare triple {1484#(= 1 (select |#valid| main_~p~0.base))} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1484#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:37,590 INFO L280 TraceCheckUtils]: 18: Hoare triple {1484#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {1477#false} is VALID [2020-07-29 01:19:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:37,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485008156] [2020-07-29 01:19:37,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:37,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:37,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521035304] [2020-07-29 01:19:37,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:37,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:37,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:37,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:37,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:37,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:37,616 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 7 states. [2020-07-29 01:19:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,495 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2020-07-29 01:19:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:38,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-29 01:19:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2020-07-29 01:19:38,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2020-07-29 01:19:38,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:38,674 INFO L225 Difference]: With dead ends: 109 [2020-07-29 01:19:38,677 INFO L226 Difference]: Without dead ends: 109 [2020-07-29 01:19:38,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-29 01:19:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2020-07-29 01:19:38,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:38,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 87 states. [2020-07-29 01:19:38,693 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 87 states. [2020-07-29 01:19:38,693 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 87 states. [2020-07-29 01:19:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,698 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2020-07-29 01:19:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-07-29 01:19:38,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:38,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:38,699 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 109 states. [2020-07-29 01:19:38,700 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 109 states. [2020-07-29 01:19:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,704 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2020-07-29 01:19:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-07-29 01:19:38,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:38,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:38,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:38,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-29 01:19:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2020-07-29 01:19:38,710 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 19 [2020-07-29 01:19:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:38,710 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2020-07-29 01:19:38,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2020-07-29 01:19:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:38,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:38,712 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:38,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:19:38,713 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 538341658, now seen corresponding path program 1 times [2020-07-29 01:19:38,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:38,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974685434] [2020-07-29 01:19:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:38,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:38,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {1918#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1909#true} is VALID [2020-07-29 01:19:38,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {1909#true} assume true; {1909#true} is VALID [2020-07-29 01:19:38,879 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1909#true} {1909#true} #153#return; {1909#true} is VALID [2020-07-29 01:19:38,888 INFO L263 TraceCheckUtils]: 0: Hoare triple {1909#true} call ULTIMATE.init(); {1918#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:38,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {1918#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1909#true} is VALID [2020-07-29 01:19:38,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {1909#true} assume true; {1909#true} is VALID [2020-07-29 01:19:38,889 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1909#true} {1909#true} #153#return; {1909#true} is VALID [2020-07-29 01:19:38,889 INFO L263 TraceCheckUtils]: 4: Hoare triple {1909#true} call #t~ret14 := main(); {1909#true} is VALID [2020-07-29 01:19:38,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {1909#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1909#true} is VALID [2020-07-29 01:19:38,890 INFO L280 TraceCheckUtils]: 6: Hoare triple {1909#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1909#true} is VALID [2020-07-29 01:19:38,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {1909#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1909#true} is VALID [2020-07-29 01:19:38,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {1909#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1909#true} is VALID [2020-07-29 01:19:38,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {1909#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1909#true} is VALID [2020-07-29 01:19:38,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {1909#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L526 {1909#true} is VALID [2020-07-29 01:19:38,896 INFO L280 TraceCheckUtils]: 11: Hoare triple {1909#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1914#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:38,897 INFO L280 TraceCheckUtils]: 12: Hoare triple {1914#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1914#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:38,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {1914#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L528-3 {1915#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:38,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {1915#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L529 {1916#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} is VALID [2020-07-29 01:19:38,904 INFO L280 TraceCheckUtils]: 15: Hoare triple {1916#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1917#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:38,905 INFO L280 TraceCheckUtils]: 16: Hoare triple {1917#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1917#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:38,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {1917#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1917#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:38,906 INFO L280 TraceCheckUtils]: 18: Hoare triple {1917#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {1910#false} is VALID [2020-07-29 01:19:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:38,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974685434] [2020-07-29 01:19:38,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:38,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:38,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172000257] [2020-07-29 01:19:38,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:38,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:38,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:38,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:38,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:38,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:38,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:38,939 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 7 states. [2020-07-29 01:19:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,059 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2020-07-29 01:19:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:40,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2020-07-29 01:19:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2020-07-29 01:19:40,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2020-07-29 01:19:40,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:40,215 INFO L225 Difference]: With dead ends: 110 [2020-07-29 01:19:40,215 INFO L226 Difference]: Without dead ends: 110 [2020-07-29 01:19:40,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-29 01:19:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2020-07-29 01:19:40,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:40,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 78 states. [2020-07-29 01:19:40,221 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 78 states. [2020-07-29 01:19:40,222 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 78 states. [2020-07-29 01:19:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,234 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2020-07-29 01:19:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2020-07-29 01:19:40,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:40,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:40,235 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 110 states. [2020-07-29 01:19:40,235 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 110 states. [2020-07-29 01:19:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,239 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2020-07-29 01:19:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2020-07-29 01:19:40,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:40,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:40,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:40,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-29 01:19:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2020-07-29 01:19:40,243 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 19 [2020-07-29 01:19:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:40,243 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2020-07-29 01:19:40,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2020-07-29 01:19:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:40,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:40,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:40,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:19:40,244 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:40,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1465888843, now seen corresponding path program 1 times [2020-07-29 01:19:40,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:40,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074716994] [2020-07-29 01:19:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:40,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:40,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {2349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2340#true} is VALID [2020-07-29 01:19:40,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {2340#true} assume true; {2340#true} is VALID [2020-07-29 01:19:40,354 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2340#true} {2340#true} #153#return; {2340#true} is VALID [2020-07-29 01:19:40,355 INFO L263 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:40,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {2349#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2340#true} is VALID [2020-07-29 01:19:40,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2020-07-29 01:19:40,355 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #153#return; {2340#true} is VALID [2020-07-29 01:19:40,355 INFO L263 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret14 := main(); {2340#true} is VALID [2020-07-29 01:19:40,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {2340#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2340#true} is VALID [2020-07-29 01:19:40,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {2340#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2340#true} is VALID [2020-07-29 01:19:40,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {2340#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:40,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:40,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:40,367 INFO L280 TraceCheckUtils]: 10: Hoare triple {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:40,370 INFO L280 TraceCheckUtils]: 11: Hoare triple {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:40,371 INFO L280 TraceCheckUtils]: 12: Hoare triple {2345#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-3 {2346#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:40,371 INFO L280 TraceCheckUtils]: 13: Hoare triple {2346#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:40,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-3 {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:40,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:40,373 INFO L280 TraceCheckUtils]: 16: Hoare triple {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-2 {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:40,376 INFO L280 TraceCheckUtils]: 17: Hoare triple {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:40,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {2347#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-3 {2348#(= |main_#t~mem13| 3)} is VALID [2020-07-29 01:19:40,378 INFO L280 TraceCheckUtils]: 19: Hoare triple {2348#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2341#false} is VALID [2020-07-29 01:19:40,378 INFO L280 TraceCheckUtils]: 20: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2020-07-29 01:19:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:40,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074716994] [2020-07-29 01:19:40,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:40,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:19:40,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843676821] [2020-07-29 01:19:40,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:40,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:40,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:40,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:40,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:40,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:40,407 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 7 states. [2020-07-29 01:19:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,026 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2020-07-29 01:19:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:41,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2020-07-29 01:19:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2020-07-29 01:19:41,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2020-07-29 01:19:41,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:41,180 INFO L225 Difference]: With dead ends: 122 [2020-07-29 01:19:41,180 INFO L226 Difference]: Without dead ends: 122 [2020-07-29 01:19:41,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-29 01:19:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2020-07-29 01:19:41,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:41,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 82 states. [2020-07-29 01:19:41,186 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 82 states. [2020-07-29 01:19:41,186 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 82 states. [2020-07-29 01:19:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,191 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2020-07-29 01:19:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2020-07-29 01:19:41,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,192 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 122 states. [2020-07-29 01:19:41,192 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 122 states. [2020-07-29 01:19:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,196 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2020-07-29 01:19:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2020-07-29 01:19:41,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:41,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-29 01:19:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2020-07-29 01:19:41,200 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 21 [2020-07-29 01:19:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:41,200 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2020-07-29 01:19:41,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-29 01:19:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:41,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:41,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:41,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:19:41,202 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1465836288, now seen corresponding path program 1 times [2020-07-29 01:19:41,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:41,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739022724] [2020-07-29 01:19:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:41,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:41,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {2813#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2804#true} is VALID [2020-07-29 01:19:41,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {2804#true} assume true; {2804#true} is VALID [2020-07-29 01:19:41,292 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2804#true} {2804#true} #153#return; {2804#true} is VALID [2020-07-29 01:19:41,294 INFO L263 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2813#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:41,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {2813#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2804#true} is VALID [2020-07-29 01:19:41,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2020-07-29 01:19:41,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #153#return; {2804#true} is VALID [2020-07-29 01:19:41,295 INFO L263 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret14 := main(); {2804#true} is VALID [2020-07-29 01:19:41,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {2804#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2804#true} is VALID [2020-07-29 01:19:41,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {2804#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2804#true} is VALID [2020-07-29 01:19:41,296 INFO L280 TraceCheckUtils]: 7: Hoare triple {2804#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:41,297 INFO L280 TraceCheckUtils]: 8: Hoare triple {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:41,297 INFO L280 TraceCheckUtils]: 9: Hoare triple {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:41,298 INFO L280 TraceCheckUtils]: 10: Hoare triple {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:41,299 INFO L280 TraceCheckUtils]: 11: Hoare triple {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:41,300 INFO L280 TraceCheckUtils]: 12: Hoare triple {2809#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L532-3 {2810#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:41,301 INFO L280 TraceCheckUtils]: 13: Hoare triple {2810#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2811#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:41,301 INFO L280 TraceCheckUtils]: 14: Hoare triple {2811#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L541-3 {2811#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:41,302 INFO L280 TraceCheckUtils]: 15: Hoare triple {2811#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {2811#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:41,303 INFO L280 TraceCheckUtils]: 16: Hoare triple {2811#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-2 {2812#(= |main_#t~mem11| 3)} is VALID [2020-07-29 01:19:41,303 INFO L280 TraceCheckUtils]: 17: Hoare triple {2812#(= |main_#t~mem11| 3)} assume !!(1 == #t~mem11);havoc #t~mem11; {2805#false} is VALID [2020-07-29 01:19:41,303 INFO L280 TraceCheckUtils]: 18: Hoare triple {2805#false} SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L544 {2805#false} is VALID [2020-07-29 01:19:41,304 INFO L280 TraceCheckUtils]: 19: Hoare triple {2805#false} ~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {2805#false} is VALID [2020-07-29 01:19:41,304 INFO L280 TraceCheckUtils]: 20: Hoare triple {2805#false} assume !(1 == #valid[~p~0.base]); {2805#false} is VALID [2020-07-29 01:19:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:41,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739022724] [2020-07-29 01:19:41,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:41,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:19:41,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38829672] [2020-07-29 01:19:41,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:41,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:41,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:41,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:41,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:41,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:41,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:41,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:41,330 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 7 states. [2020-07-29 01:19:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,921 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2020-07-29 01:19:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:41,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2020-07-29 01:19:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2020-07-29 01:19:41,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2020-07-29 01:19:42,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:42,053 INFO L225 Difference]: With dead ends: 105 [2020-07-29 01:19:42,053 INFO L226 Difference]: Without dead ends: 105 [2020-07-29 01:19:42,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-29 01:19:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2020-07-29 01:19:42,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:42,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 82 states. [2020-07-29 01:19:42,059 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 82 states. [2020-07-29 01:19:42,059 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 82 states. [2020-07-29 01:19:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:42,062 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2020-07-29 01:19:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2020-07-29 01:19:42,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:42,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:42,064 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 105 states. [2020-07-29 01:19:42,064 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 105 states. [2020-07-29 01:19:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:42,068 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2020-07-29 01:19:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2020-07-29 01:19:42,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:42,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:42,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:42,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-29 01:19:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2020-07-29 01:19:42,072 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 21 [2020-07-29 01:19:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:42,072 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2020-07-29 01:19:42,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-29 01:19:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:42,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:42,073 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:42,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:19:42,074 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1761650517, now seen corresponding path program 1 times [2020-07-29 01:19:42,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:42,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261983584] [2020-07-29 01:19:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:42,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:42,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {3226#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3217#true} is VALID [2020-07-29 01:19:42,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {3217#true} assume true; {3217#true} is VALID [2020-07-29 01:19:42,189 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3217#true} {3217#true} #153#return; {3217#true} is VALID [2020-07-29 01:19:42,190 INFO L263 TraceCheckUtils]: 0: Hoare triple {3217#true} call ULTIMATE.init(); {3226#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:42,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {3226#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3217#true} is VALID [2020-07-29 01:19:42,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {3217#true} assume true; {3217#true} is VALID [2020-07-29 01:19:42,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3217#true} {3217#true} #153#return; {3217#true} is VALID [2020-07-29 01:19:42,191 INFO L263 TraceCheckUtils]: 4: Hoare triple {3217#true} call #t~ret14 := main(); {3217#true} is VALID [2020-07-29 01:19:42,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {3217#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3217#true} is VALID [2020-07-29 01:19:42,192 INFO L280 TraceCheckUtils]: 6: Hoare triple {3217#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3217#true} is VALID [2020-07-29 01:19:42,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {3217#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3217#true} is VALID [2020-07-29 01:19:42,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {3217#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3217#true} is VALID [2020-07-29 01:19:42,193 INFO L280 TraceCheckUtils]: 9: Hoare triple {3217#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {3217#true} is VALID [2020-07-29 01:19:42,193 INFO L280 TraceCheckUtils]: 10: Hoare triple {3217#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3217#true} is VALID [2020-07-29 01:19:42,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {3217#true} assume !!(0 != #t~nondet6);havoc #t~nondet6; {3217#true} is VALID [2020-07-29 01:19:42,194 INFO L280 TraceCheckUtils]: 12: Hoare triple {3217#true} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L533 {3217#true} is VALID [2020-07-29 01:19:42,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {3217#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3222#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:42,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {3222#(= 1 (select |#valid| main_~t~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3222#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:42,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {3222#(= 1 (select |#valid| main_~t~0.base))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L535-3 {3223#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:42,199 INFO L280 TraceCheckUtils]: 16: Hoare triple {3223#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L536 {3224#(= 1 (select |#valid| |main_#t~mem8.base|))} is VALID [2020-07-29 01:19:42,199 INFO L280 TraceCheckUtils]: 17: Hoare triple {3224#(= 1 (select |#valid| |main_#t~mem8.base|))} ~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3225#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:42,200 INFO L280 TraceCheckUtils]: 18: Hoare triple {3225#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3225#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:42,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {3225#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet6);havoc #t~nondet6; {3225#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:42,201 INFO L280 TraceCheckUtils]: 20: Hoare triple {3225#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {3218#false} is VALID [2020-07-29 01:19:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:42,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261983584] [2020-07-29 01:19:42,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:42,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:42,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630890559] [2020-07-29 01:19:42,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:42,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:42,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:42,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:42,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:42,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:42,230 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 7 states. [2020-07-29 01:19:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:42,923 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2020-07-29 01:19:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:42,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2020-07-29 01:19:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2020-07-29 01:19:42,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2020-07-29 01:19:43,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:43,067 INFO L225 Difference]: With dead ends: 88 [2020-07-29 01:19:43,068 INFO L226 Difference]: Without dead ends: 88 [2020-07-29 01:19:43,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-29 01:19:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2020-07-29 01:19:43,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:43,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 80 states. [2020-07-29 01:19:43,072 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 80 states. [2020-07-29 01:19:43,072 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 80 states. [2020-07-29 01:19:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:43,075 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2020-07-29 01:19:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2020-07-29 01:19:43,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:43,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:43,076 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 88 states. [2020-07-29 01:19:43,076 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 88 states. [2020-07-29 01:19:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:43,079 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2020-07-29 01:19:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2020-07-29 01:19:43,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:43,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:43,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:43,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-29 01:19:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2020-07-29 01:19:43,083 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 21 [2020-07-29 01:19:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:43,083 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2020-07-29 01:19:43,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2020-07-29 01:19:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:43,084 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:43,085 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:43,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:19:43,085 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:43,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1761650516, now seen corresponding path program 1 times [2020-07-29 01:19:43,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:43,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299349881] [2020-07-29 01:19:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:43,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:43,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {3589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3580#true} is VALID [2020-07-29 01:19:43,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {3580#true} assume true; {3580#true} is VALID [2020-07-29 01:19:43,214 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3580#true} {3580#true} #153#return; {3580#true} is VALID [2020-07-29 01:19:43,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {3580#true} call ULTIMATE.init(); {3589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:43,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {3589#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3580#true} is VALID [2020-07-29 01:19:43,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {3580#true} assume true; {3580#true} is VALID [2020-07-29 01:19:43,216 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3580#true} {3580#true} #153#return; {3580#true} is VALID [2020-07-29 01:19:43,216 INFO L263 TraceCheckUtils]: 4: Hoare triple {3580#true} call #t~ret14 := main(); {3580#true} is VALID [2020-07-29 01:19:43,216 INFO L280 TraceCheckUtils]: 5: Hoare triple {3580#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3580#true} is VALID [2020-07-29 01:19:43,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {3580#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3580#true} is VALID [2020-07-29 01:19:43,217 INFO L280 TraceCheckUtils]: 7: Hoare triple {3580#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3580#true} is VALID [2020-07-29 01:19:43,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {3580#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3580#true} is VALID [2020-07-29 01:19:43,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {3580#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {3580#true} is VALID [2020-07-29 01:19:43,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {3580#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3580#true} is VALID [2020-07-29 01:19:43,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {3580#true} assume !!(0 != #t~nondet6);havoc #t~nondet6; {3580#true} is VALID [2020-07-29 01:19:43,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {3580#true} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L533 {3580#true} is VALID [2020-07-29 01:19:43,221 INFO L280 TraceCheckUtils]: 13: Hoare triple {3580#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3585#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:43,222 INFO L280 TraceCheckUtils]: 14: Hoare triple {3585#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3585#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:43,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {3585#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L535-3 {3586#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:43,225 INFO L280 TraceCheckUtils]: 16: Hoare triple {3586#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L536 {3587#(and (= 8 (select |#length| |main_#t~mem8.base|)) (= 0 |main_#t~mem8.offset|))} is VALID [2020-07-29 01:19:43,226 INFO L280 TraceCheckUtils]: 17: Hoare triple {3587#(and (= 8 (select |#length| |main_#t~mem8.base|)) (= 0 |main_#t~mem8.offset|))} ~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3588#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:43,233 INFO L280 TraceCheckUtils]: 18: Hoare triple {3588#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3588#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:43,234 INFO L280 TraceCheckUtils]: 19: Hoare triple {3588#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {3588#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:43,235 INFO L280 TraceCheckUtils]: 20: Hoare triple {3588#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(4 + ~p~0.offset <= #length[~p~0.base] && 0 <= ~p~0.offset); {3581#false} is VALID [2020-07-29 01:19:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:43,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299349881] [2020-07-29 01:19:43,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:43,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:43,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919047420] [2020-07-29 01:19:43,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:43,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:43,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:43,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:43,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:43,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:43,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:43,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:43,267 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 7 states. [2020-07-29 01:19:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:44,126 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-07-29 01:19:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:44,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2020-07-29 01:19:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2020-07-29 01:19:44,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 86 transitions. [2020-07-29 01:19:44,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:44,267 INFO L225 Difference]: With dead ends: 85 [2020-07-29 01:19:44,267 INFO L226 Difference]: Without dead ends: 85 [2020-07-29 01:19:44,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-29 01:19:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2020-07-29 01:19:44,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:44,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 68 states. [2020-07-29 01:19:44,270 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 68 states. [2020-07-29 01:19:44,271 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 68 states. [2020-07-29 01:19:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:44,274 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-07-29 01:19:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2020-07-29 01:19:44,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:44,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:44,275 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 85 states. [2020-07-29 01:19:44,275 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 85 states. [2020-07-29 01:19:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:44,277 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-07-29 01:19:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2020-07-29 01:19:44,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:44,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:44,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:44,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-29 01:19:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2020-07-29 01:19:44,279 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 21 [2020-07-29 01:19:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:44,280 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2020-07-29 01:19:44,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-29 01:19:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:19:44,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:44,280 INFO L422 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] [2020-07-29 01:19:44,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:44,281 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-07-29 01:19:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1802091221, now seen corresponding path program 1 times [2020-07-29 01:19:44,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:44,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243316026] [2020-07-29 01:19:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:44,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:44,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:44,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:44,332 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:44,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-29 01:19:44,351 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:19:44,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:44 BoogieIcfgContainer [2020-07-29 01:19:44,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:44,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:44,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:44,379 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:44,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:33" (3/4) ... [2020-07-29 01:19:44,384 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:44,395 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:19:44,470 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:44,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:44,473 INFO L168 Benchmark]: Toolchain (without parser) took 12712.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 956.2 MB in the beginning and 993.8 MB in the end (delta: -37.6 MB). Peak memory consumption was 262.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:44,474 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:44,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:44,475 INFO L168 Benchmark]: Boogie Preprocessor took 73.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:44,476 INFO L168 Benchmark]: RCFGBuilder took 1006.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:44,486 INFO L168 Benchmark]: TraceAbstraction took 10920.69 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:44,488 INFO L168 Benchmark]: Witness Printer took 92.56 ms. Allocated memory is still 1.3 GB. Free memory is still 993.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:44,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1006.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10920.69 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. * Witness Printer took 92.56 ms. Allocated memory is still 1.3 GB. Free memory is still 993.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 520]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L540] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L541] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L545] COND FALSE !(p->h != 3) [L547] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 89 locations, 26 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.8s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 463 SDtfs, 689 SDslu, 939 SDs, 0 SdLazy, 1838 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 194 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 12096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...