./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_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/alternating_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 9c54128245d3ab9ad313da188c7be33f66027c6a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:19:28,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:19:28,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:19:28,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:19:28,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:19:28,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:19:28,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:19:28,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:19:28,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:19:28,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:19:28,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:19:28,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:19:28,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:19:28,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:19:28,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:19:28,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:19:28,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:19:28,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:19:28,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:19:28,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:19:28,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:19:28,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:19:28,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:19:28,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:19:28,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:19:28,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:19:28,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:19:28,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:19:28,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:19:28,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:19:28,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:19:28,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:19:28,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:19:28,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:19:28,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:19:28,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:19:28,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:19:28,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:19:28,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:19:28,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:19:28,476 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:28,492 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:19:28,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:19:28,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:19:28,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:19:28,494 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:19:28,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:19:28,495 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:19:28,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:19:28,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:19:28,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:19:28,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:19:28,496 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:19:28,497 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:19:28,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:19:28,497 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:19:28,498 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:19:28,498 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:19:28,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:19:28,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:19:28,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:19:28,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:19:28,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:19:28,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:19:28,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:19:28,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:19:28,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:19:28,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:19:28,501 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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2020-07-29 01:19:28,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:19:28,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:19:28,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:19:28,847 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:19:28,848 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:19:28,849 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2020-07-29 01:19:28,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f55d9d0c/6f68bff5a0184cba997cc835ec690e5a/FLAGfd4617ead [2020-07-29 01:19:29,430 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:19:29,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2020-07-29 01:19:29,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f55d9d0c/6f68bff5a0184cba997cc835ec690e5a/FLAGfd4617ead [2020-07-29 01:19:29,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f55d9d0c/6f68bff5a0184cba997cc835ec690e5a [2020-07-29 01:19:29,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:19:29,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:19:29,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:29,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:19:29,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:19:29,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:29" (1/1) ... [2020-07-29 01:19:29,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437dda0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:29, skipping insertion in model container [2020-07-29 01:19:29,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:29" (1/1) ... [2020-07-29 01:19:29,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:19:29,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:19:30,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:30,325 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:19:30,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:30,448 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:19:30,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:30 WrapperNode [2020-07-29 01:19:30,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:30,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:19:30,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:19:30,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:19:30,464 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:30" (1/1) ... [2020-07-29 01:19:30,465 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:30" (1/1) ... [2020-07-29 01:19:30,482 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:30" (1/1) ... [2020-07-29 01:19:30,482 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:30" (1/1) ... [2020-07-29 01:19:30,509 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:30" (1/1) ... [2020-07-29 01:19:30,516 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:30" (1/1) ... [2020-07-29 01:19:30,522 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:30" (1/1) ... [2020-07-29 01:19:30,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:19:30,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:19:30,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:19:30,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:19:30,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:30" (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:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:19:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:19:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:19:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:19:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:19:30,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:19:30,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:19:30,621 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-29 01:19:30,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:19:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:19:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:19:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:19:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:19:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:19:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:19:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:19:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:19:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:19:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:19:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:19:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:19:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:19:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:19:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:19:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:19:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:19:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:19:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:19:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:19:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:19:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:19:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:19:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:19:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:19:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:19:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:19:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:19:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:19:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:19:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:19:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:19:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:19:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:19:30,629 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:19:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:19:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:19:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:19:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:19:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:19:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:19:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:19:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:19:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:19:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:19:30,632 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:19:30,632 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:19:30,632 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:19:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:19:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:19:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:19:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:19:30,633 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:19:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:19:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:19:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:19:30,634 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:19:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:19:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:19:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:19:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:19:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:19:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:19:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:19:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:19:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:19:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:19:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:19:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:19:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:19:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:19:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:19:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:19:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:19:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:19:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:19:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:19:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:19:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:19:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:19:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:19:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:19:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:19:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:19:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:19:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:19:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:19:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:19:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:19:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:19:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:19:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:19:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:19:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:19:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:19:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:19:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:19:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:19:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:19:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:19:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:19:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:19:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:19:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:19:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:19:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:19:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:19:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:19:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:19:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-29 01:19:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:19:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:19:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:19:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:19:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:19:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:19:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:19:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:19:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:19:31,030 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-29 01:19:31,392 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:19:31,393 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-29 01:19:31,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:31 BoogieIcfgContainer [2020-07-29 01:19:31,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:19:31,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:19:31,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:19:31,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:19:31,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:19:29" (1/3) ... [2020-07-29 01:19:31,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31513a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:31, skipping insertion in model container [2020-07-29 01:19:31,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:30" (2/3) ... [2020-07-29 01:19:31,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31513a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:31, skipping insertion in model container [2020-07-29 01:19:31,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:31" (3/3) ... [2020-07-29 01:19:31,409 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2020-07-29 01:19:31,420 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:19:31,430 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-07-29 01:19:31,446 INFO L251 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-07-29 01:19:31,471 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:19:31,472 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:19:31,472 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:19:31,472 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:19:31,473 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:19:31,473 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:19:31,473 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:19:31,473 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:19:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-29 01:19:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:19:31,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:31,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:31,508 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 783594837, now seen corresponding path program 1 times [2020-07-29 01:19:31,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:31,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148356773] [2020-07-29 01:19:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:31,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:31,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(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; {84#true} is VALID [2020-07-29 01:19:31,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-29 01:19:31,746 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {84#true} {84#true} #157#return; {84#true} is VALID [2020-07-29 01:19:31,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:31,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(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; {84#true} is VALID [2020-07-29 01:19:31,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-29 01:19:31,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #157#return; {84#true} is VALID [2020-07-29 01:19:31,751 INFO L263 TraceCheckUtils]: 4: Hoare triple {84#true} call #t~ret12 := main(); {84#true} is VALID [2020-07-29 01:19:31,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {84#true} is VALID [2020-07-29 01:19:31,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {84#true} is VALID [2020-07-29 01:19:31,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {84#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {84#true} is VALID [2020-07-29 01:19:31,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-29 01:19:31,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#false} assume !(1 == #valid[~p~0.base]); {85#false} is VALID [2020-07-29 01:19:31,755 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:31,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148356773] [2020-07-29 01:19:31,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:31,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:31,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258418743] [2020-07-29 01:19:31,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:19:31,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:31,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:19:31,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:31,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:19:31,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:31,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:19:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:19:31,812 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2020-07-29 01:19:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:32,198 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-07-29 01:19:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:19:32,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:19:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:19:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2020-07-29 01:19:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:19:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2020-07-29 01:19:32,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2020-07-29 01:19:32,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:32,373 INFO L225 Difference]: With dead ends: 81 [2020-07-29 01:19:32,373 INFO L226 Difference]: Without dead ends: 74 [2020-07-29 01:19:32,376 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:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-29 01:19:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-29 01:19:32,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:32,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-29 01:19:32,417 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-29 01:19:32,418 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-29 01:19:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:32,427 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:19:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:19:32,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:32,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:32,429 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-29 01:19:32,429 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-29 01:19:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:32,442 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:19:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:19:32,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:32,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:32,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:32,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-29 01:19:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-07-29 01:19:32,451 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 10 [2020-07-29 01:19:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:32,452 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-07-29 01:19:32,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:19:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:19:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:19:32,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:32,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:32,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:19:32,455 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1478399476, now seen corresponding path program 1 times [2020-07-29 01:19:32,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:32,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358955460] [2020-07-29 01:19:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:32,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:32,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {402#(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; {395#true} is VALID [2020-07-29 01:19:32,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-29 01:19:32,570 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {395#true} {395#true} #157#return; {395#true} is VALID [2020-07-29 01:19:32,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {402#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:32,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#(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; {395#true} is VALID [2020-07-29 01:19:32,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2020-07-29 01:19:32,573 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {395#true} {395#true} #157#return; {395#true} is VALID [2020-07-29 01:19:32,573 INFO L263 TraceCheckUtils]: 4: Hoare triple {395#true} call #t~ret12 := main(); {395#true} is VALID [2020-07-29 01:19:32,575 INFO L280 TraceCheckUtils]: 5: Hoare triple {395#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {400#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:32,576 INFO L280 TraceCheckUtils]: 6: Hoare triple {400#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {400#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-29 01:19:32,577 INFO L280 TraceCheckUtils]: 7: Hoare triple {400#(= 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; {401#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:32,578 INFO L280 TraceCheckUtils]: 8: Hoare triple {401#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {401#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:32,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {401#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {401#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:32,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {401#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {396#false} is VALID [2020-07-29 01:19:32,582 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:32,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358955460] [2020-07-29 01:19:32,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:32,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:32,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722287335] [2020-07-29 01:19:32,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:32,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:32,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:32,606 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:32,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:32,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:32,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:32,608 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2020-07-29 01:19:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:33,189 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-07-29 01:19:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:33,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2020-07-29 01:19:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2020-07-29 01:19:33,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2020-07-29 01:19:33,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:33,392 INFO L225 Difference]: With dead ends: 95 [2020-07-29 01:19:33,392 INFO L226 Difference]: Without dead ends: 95 [2020-07-29 01:19:33,394 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:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-29 01:19:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2020-07-29 01:19:33,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:33,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 75 states. [2020-07-29 01:19:33,411 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 75 states. [2020-07-29 01:19:33,413 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 75 states. [2020-07-29 01:19:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:33,422 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-07-29 01:19:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2020-07-29 01:19:33,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:33,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:33,428 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 95 states. [2020-07-29 01:19:33,428 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 95 states. [2020-07-29 01:19:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:33,435 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-07-29 01:19:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2020-07-29 01:19:33,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:33,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:33,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:33,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-29 01:19:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2020-07-29 01:19:33,446 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 11 [2020-07-29 01:19:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:33,447 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2020-07-29 01:19:33,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-29 01:19:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:19:33,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:33,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:33,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:19:33,449 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1478399475, now seen corresponding path program 1 times [2020-07-29 01:19:33,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:33,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346706765] [2020-07-29 01:19:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:33,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:33,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#(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; {767#true} is VALID [2020-07-29 01:19:33,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {767#true} assume true; {767#true} is VALID [2020-07-29 01:19:33,599 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {767#true} {767#true} #157#return; {767#true} is VALID [2020-07-29 01:19:33,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {767#true} call ULTIMATE.init(); {774#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:33,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#(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; {767#true} is VALID [2020-07-29 01:19:33,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {767#true} assume true; {767#true} is VALID [2020-07-29 01:19:33,601 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {767#true} {767#true} #157#return; {767#true} is VALID [2020-07-29 01:19:33,601 INFO L263 TraceCheckUtils]: 4: Hoare triple {767#true} call #t~ret12 := main(); {767#true} is VALID [2020-07-29 01:19:33,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {767#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {772#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:19:33,604 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {772#(and (= 0 main_~a~0.offset) (= (select |#length| main_~a~0.base) 8))} is VALID [2020-07-29 01:19:33,605 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#(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; {773#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:33,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {773#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {773#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:33,608 INFO L280 TraceCheckUtils]: 9: Hoare triple {773#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {773#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:33,609 INFO L280 TraceCheckUtils]: 10: Hoare triple {773#(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); {768#false} is VALID [2020-07-29 01:19:33,610 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,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346706765] [2020-07-29 01:19:33,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:33,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:33,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717172124] [2020-07-29 01:19:33,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:33,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:33,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:33,629 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,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:33,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:33,630 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 5 states. [2020-07-29 01:19:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:34,195 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-29 01:19:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:34,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:19:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2020-07-29 01:19:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2020-07-29 01:19:34,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2020-07-29 01:19:34,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:34,375 INFO L225 Difference]: With dead ends: 103 [2020-07-29 01:19:34,375 INFO L226 Difference]: Without dead ends: 103 [2020-07-29 01:19:34,376 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:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-29 01:19:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2020-07-29 01:19:34,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:34,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 91 states. [2020-07-29 01:19:34,388 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 91 states. [2020-07-29 01:19:34,388 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 91 states. [2020-07-29 01:19:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:34,393 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-29 01:19:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-29 01:19:34,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:34,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:34,400 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 103 states. [2020-07-29 01:19:34,400 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 103 states. [2020-07-29 01:19:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:34,406 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-07-29 01:19:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-29 01:19:34,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:34,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:34,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:34,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-29 01:19:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2020-07-29 01:19:34,414 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 11 [2020-07-29 01:19:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:34,417 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2020-07-29 01:19:34,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2020-07-29 01:19:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:19:34,418 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:34,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:34,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:19:34,422 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -203522987, now seen corresponding path program 1 times [2020-07-29 01:19:34,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:34,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902981656] [2020-07-29 01:19:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:34,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:34,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {1188#(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; {1179#true} is VALID [2020-07-29 01:19:34,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {1179#true} assume true; {1179#true} is VALID [2020-07-29 01:19:34,585 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1179#true} {1179#true} #157#return; {1179#true} is VALID [2020-07-29 01:19:34,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1188#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:34,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {1188#(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; {1179#true} is VALID [2020-07-29 01:19:34,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2020-07-29 01:19:34,586 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #157#return; {1179#true} is VALID [2020-07-29 01:19:34,586 INFO L263 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret12 := main(); {1179#true} is VALID [2020-07-29 01:19:34,587 INFO L280 TraceCheckUtils]: 5: Hoare triple {1179#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1179#true} is VALID [2020-07-29 01:19:34,587 INFO L280 TraceCheckUtils]: 6: Hoare triple {1179#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1179#true} is VALID [2020-07-29 01:19:34,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {1179#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1184#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:34,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {1184#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1184#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:34,596 INFO L280 TraceCheckUtils]: 9: Hoare triple {1184#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1184#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:34,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {1184#(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: L526-4 {1185#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:34,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {1185#(= 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;~flag~0 := 1; {1186#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:34,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {1186#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L542-3 {1187#(= 3 |main_#t~mem6|)} is VALID [2020-07-29 01:19:34,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {1187#(= 3 |main_#t~mem6|)} assume !!(3 != #t~mem6);havoc #t~mem6; {1180#false} is VALID [2020-07-29 01:19:34,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {1180#false} assume 0 != ~flag~0;~flag~0 := 0; {1180#false} is VALID [2020-07-29 01:19:34,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {1180#false} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L545 {1180#false} is VALID [2020-07-29 01:19:34,600 INFO L280 TraceCheckUtils]: 16: Hoare triple {1180#false} assume 1 != #t~mem7;havoc #t~mem7; {1180#false} is VALID [2020-07-29 01:19:34,600 INFO L280 TraceCheckUtils]: 17: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2020-07-29 01:19:34,602 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,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902981656] [2020-07-29 01:19:34,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:34,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:19:34,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46308041] [2020-07-29 01:19:34,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:19:34,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:34,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:34,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:34,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:34,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:34,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:34,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:34,637 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 7 states. [2020-07-29 01:19:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,433 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2020-07-29 01:19:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:35,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-29 01:19:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2020-07-29 01:19:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2020-07-29 01:19:35,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2020-07-29 01:19:35,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:35,606 INFO L225 Difference]: With dead ends: 136 [2020-07-29 01:19:35,607 INFO L226 Difference]: Without dead ends: 136 [2020-07-29 01:19:35,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-29 01:19:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 94. [2020-07-29 01:19:35,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:35,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 94 states. [2020-07-29 01:19:35,614 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 94 states. [2020-07-29 01:19:35,614 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 94 states. [2020-07-29 01:19:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,619 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2020-07-29 01:19:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2020-07-29 01:19:35,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:35,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:35,620 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 136 states. [2020-07-29 01:19:35,620 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 136 states. [2020-07-29 01:19:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,625 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2020-07-29 01:19:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2020-07-29 01:19:35,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:35,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:35,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:35,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-29 01:19:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-07-29 01:19:35,630 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 18 [2020-07-29 01:19:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:35,630 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-07-29 01:19:35,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-07-29 01:19:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:35,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:35,631 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:35,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:19:35,632 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2045615242, now seen corresponding path program 1 times [2020-07-29 01:19:35,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:35,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841753629] [2020-07-29 01:19:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:35,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:35,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {1704#(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; {1697#true} is VALID [2020-07-29 01:19:35,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1697#true} assume true; {1697#true} is VALID [2020-07-29 01:19:35,711 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1697#true} {1697#true} #157#return; {1697#true} is VALID [2020-07-29 01:19:35,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1704#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:35,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {1704#(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; {1697#true} is VALID [2020-07-29 01:19:35,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2020-07-29 01:19:35,713 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #157#return; {1697#true} is VALID [2020-07-29 01:19:35,713 INFO L263 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret12 := main(); {1697#true} is VALID [2020-07-29 01:19:35,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {1697#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,715 INFO L280 TraceCheckUtils]: 7: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} assume !(0 != #t~nondet3);havoc #t~nondet3; {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,717 INFO L280 TraceCheckUtils]: 10: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-4 {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,717 INFO L280 TraceCheckUtils]: 12: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L542-3 {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,718 INFO L280 TraceCheckUtils]: 13: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} assume !(3 != #t~mem6);havoc #t~mem6; {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,718 INFO L280 TraceCheckUtils]: 14: Hoare triple {1702#(<= (+ main_~a~0.base 1) |#StackHeapBarrier|)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,719 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L555-3 {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(3 != #t~mem10);havoc #t~mem10; {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,720 INFO L280 TraceCheckUtils]: 17: Hoare triple {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume 0 == ~p~0.offset; {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:19:35,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {1703#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(~p~0.base < #StackHeapBarrier); {1698#false} is VALID [2020-07-29 01:19:35,721 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,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841753629] [2020-07-29 01:19:35,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:35,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:35,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848048859] [2020-07-29 01:19:35,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-29 01:19:35,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:35,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:35,753 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:35,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:35,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:35,755 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states. [2020-07-29 01:19:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:36,182 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2020-07-29 01:19:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:36,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-29 01:19:36,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2020-07-29 01:19:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2020-07-29 01:19:36,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 111 transitions. [2020-07-29 01:19:36,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:36,365 INFO L225 Difference]: With dead ends: 101 [2020-07-29 01:19:36,365 INFO L226 Difference]: Without dead ends: 101 [2020-07-29 01:19:36,366 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,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-29 01:19:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-07-29 01:19:36,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:36,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 95 states. [2020-07-29 01:19:36,375 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 95 states. [2020-07-29 01:19:36,375 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 95 states. [2020-07-29 01:19:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:36,379 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2020-07-29 01:19:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2020-07-29 01:19:36,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:36,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:36,381 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 101 states. [2020-07-29 01:19:36,381 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 101 states. [2020-07-29 01:19:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:36,385 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2020-07-29 01:19:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2020-07-29 01:19:36,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:36,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:36,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:36,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-29 01:19:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2020-07-29 01:19:36,391 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 19 [2020-07-29 01:19:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:36,391 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2020-07-29 01:19:36,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2020-07-29 01:19:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:36,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:36,393 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] [2020-07-29 01:19:36,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:19:36,394 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1010482820, now seen corresponding path program 1 times [2020-07-29 01:19:36,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:36,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926087038] [2020-07-29 01:19:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:36,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:36,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {2115#(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; {2107#true} is VALID [2020-07-29 01:19:36,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {2107#true} assume true; {2107#true} is VALID [2020-07-29 01:19:36,484 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2107#true} {2107#true} #157#return; {2107#true} is VALID [2020-07-29 01:19:36,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {2107#true} call ULTIMATE.init(); {2115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:36,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#(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; {2107#true} is VALID [2020-07-29 01:19:36,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {2107#true} assume true; {2107#true} is VALID [2020-07-29 01:19:36,486 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2107#true} {2107#true} #157#return; {2107#true} is VALID [2020-07-29 01:19:36,487 INFO L263 TraceCheckUtils]: 4: Hoare triple {2107#true} call #t~ret12 := main(); {2107#true} is VALID [2020-07-29 01:19:36,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {2107#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {2112#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {2112#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {2112#(= 0 main_~a~0.offset)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {2112#(= 0 main_~a~0.offset)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {2112#(= 0 main_~a~0.offset)} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-4 {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {2112#(= 0 main_~a~0.offset)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {2112#(= 0 main_~a~0.offset)} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L542-3 {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {2112#(= 0 main_~a~0.offset)} assume !(3 != #t~mem6);havoc #t~mem6; {2112#(= 0 main_~a~0.offset)} is VALID [2020-07-29 01:19:36,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {2112#(= 0 main_~a~0.offset)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2113#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:19:36,496 INFO L280 TraceCheckUtils]: 15: Hoare triple {2113#(= 0 main_~p~0.offset)} SUMMARY for call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L555-3 {2113#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:19:36,497 INFO L280 TraceCheckUtils]: 16: Hoare triple {2113#(= 0 main_~p~0.offset)} assume !!(3 != #t~mem10);havoc #t~mem10;~tmp~0.base, ~tmp~0.offset := ~p~0.base, ~p~0.offset; {2114#(= 0 main_~tmp~0.offset)} is VALID [2020-07-29 01:19:36,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {2114#(= 0 main_~tmp~0.offset)} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L557 {2114#(= 0 main_~tmp~0.offset)} is VALID [2020-07-29 01:19:36,501 INFO L280 TraceCheckUtils]: 18: Hoare triple {2114#(= 0 main_~tmp~0.offset)} ~p~0.base, ~p~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {2114#(= 0 main_~tmp~0.offset)} is VALID [2020-07-29 01:19:36,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {2114#(= 0 main_~tmp~0.offset)} assume !(0 == ~tmp~0.offset); {2108#false} is VALID [2020-07-29 01:19:36,504 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:36,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926087038] [2020-07-29 01:19:36,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:36,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:36,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133348662] [2020-07-29 01:19:36,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-29 01:19:36,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:36,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:36,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:36,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:36,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:36,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:36,534 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2020-07-29 01:19:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,041 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-07-29 01:19:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:37,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-29 01:19:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-29 01:19:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-29 01:19:37,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-29 01:19:37,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:37,203 INFO L225 Difference]: With dead ends: 105 [2020-07-29 01:19:37,203 INFO L226 Difference]: Without dead ends: 105 [2020-07-29 01:19:37,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-29 01:19:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2020-07-29 01:19:37,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:37,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 97 states. [2020-07-29 01:19:37,210 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 97 states. [2020-07-29 01:19:37,211 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 97 states. [2020-07-29 01:19:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,215 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-07-29 01:19:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2020-07-29 01:19:37,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:37,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:37,216 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 105 states. [2020-07-29 01:19:37,216 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 105 states. [2020-07-29 01:19:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,220 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2020-07-29 01:19:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2020-07-29 01:19:37,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:37,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:37,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:37,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-29 01:19:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2020-07-29 01:19:37,224 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 20 [2020-07-29 01:19:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:37,225 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2020-07-29 01:19:37,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2020-07-29 01:19:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:37,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:37,226 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:37,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:19:37,227 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1258779451, now seen corresponding path program 1 times [2020-07-29 01:19:37,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:37,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910397527] [2020-07-29 01:19:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:37,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:37,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {2544#(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; {2536#true} is VALID [2020-07-29 01:19:37,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {2536#true} assume true; {2536#true} is VALID [2020-07-29 01:19:37,353 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2536#true} {2536#true} #157#return; {2536#true} is VALID [2020-07-29 01:19:37,354 INFO L263 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2544#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:37,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {2544#(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; {2536#true} is VALID [2020-07-29 01:19:37,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2020-07-29 01:19:37,355 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #157#return; {2536#true} is VALID [2020-07-29 01:19:37,356 INFO L263 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret12 := main(); {2541#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:19:37,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {2541#(= |#valid| |old(#valid)|)} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,364 INFO L280 TraceCheckUtils]: 8: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,370 INFO L280 TraceCheckUtils]: 10: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-4 {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,371 INFO L280 TraceCheckUtils]: 11: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L542-3 {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,376 INFO L280 TraceCheckUtils]: 13: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} assume !(3 != #t~mem6);havoc #t~mem6; {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,377 INFO L280 TraceCheckUtils]: 14: Hoare triple {2542#(= (store |#valid| main_~a~0.base 0) |old(#valid)|)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,378 INFO L280 TraceCheckUtils]: 15: Hoare triple {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} SUMMARY for call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L555-3 {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,379 INFO L280 TraceCheckUtils]: 16: Hoare triple {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume !(3 != #t~mem10);havoc #t~mem10; {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,380 INFO L280 TraceCheckUtils]: 17: Hoare triple {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume 0 == ~p~0.offset; {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,380 INFO L280 TraceCheckUtils]: 18: Hoare triple {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume ~p~0.base < #StackHeapBarrier; {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} is VALID [2020-07-29 01:19:37,381 INFO L280 TraceCheckUtils]: 19: Hoare triple {2543#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset);#res := 0; {2541#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:19:37,382 INFO L280 TraceCheckUtils]: 20: Hoare triple {2541#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {2537#false} is VALID [2020-07-29 01:19:37,383 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:37,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910397527] [2020-07-29 01:19:37,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:37,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:37,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029724431] [2020-07-29 01:19:37,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:19:37,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:37,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:37,409 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:37,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:37,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:37,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:37,410 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 6 states. [2020-07-29 01:19:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,977 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2020-07-29 01:19:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:37,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:19:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-29 01:19:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-29 01:19:37,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-29 01:19:38,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:38,108 INFO L225 Difference]: With dead ends: 111 [2020-07-29 01:19:38,108 INFO L226 Difference]: Without dead ends: 107 [2020-07-29 01:19:38,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:19:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-29 01:19:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2020-07-29 01:19:38,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:38,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 100 states. [2020-07-29 01:19:38,119 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 100 states. [2020-07-29 01:19:38,119 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 100 states. [2020-07-29 01:19:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,123 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2020-07-29 01:19:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2020-07-29 01:19:38,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:38,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:38,124 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 107 states. [2020-07-29 01:19:38,124 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 107 states. [2020-07-29 01:19:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,128 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2020-07-29 01:19:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2020-07-29 01:19:38,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:38,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:38,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:38,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-29 01:19:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2020-07-29 01:19:38,133 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 21 [2020-07-29 01:19:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:38,133 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2020-07-29 01:19:38,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-07-29 01:19:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:38,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:38,135 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:38,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:19:38,135 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1260196507, now seen corresponding path program 1 times [2020-07-29 01:19:38,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:38,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437989867] [2020-07-29 01:19:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:38,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:38,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {2986#(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; {2976#true} is VALID [2020-07-29 01:19:38,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {2976#true} assume true; {2976#true} is VALID [2020-07-29 01:19:38,238 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2976#true} {2976#true} #157#return; {2976#true} is VALID [2020-07-29 01:19:38,239 INFO L263 TraceCheckUtils]: 0: Hoare triple {2976#true} call ULTIMATE.init(); {2986#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:38,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {2986#(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; {2976#true} is VALID [2020-07-29 01:19:38,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {2976#true} assume true; {2976#true} is VALID [2020-07-29 01:19:38,239 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2976#true} {2976#true} #157#return; {2976#true} is VALID [2020-07-29 01:19:38,239 INFO L263 TraceCheckUtils]: 4: Hoare triple {2976#true} call #t~ret12 := main(); {2976#true} is VALID [2020-07-29 01:19:38,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {2976#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2976#true} is VALID [2020-07-29 01:19:38,240 INFO L280 TraceCheckUtils]: 6: Hoare triple {2976#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2976#true} is VALID [2020-07-29 01:19:38,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {2976#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2976#true} is VALID [2020-07-29 01:19:38,241 INFO L280 TraceCheckUtils]: 8: Hoare triple {2976#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2976#true} is VALID [2020-07-29 01:19:38,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {2976#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2976#true} is VALID [2020-07-29 01:19:38,241 INFO L280 TraceCheckUtils]: 10: Hoare triple {2976#true} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-4 {2976#true} is VALID [2020-07-29 01:19:38,242 INFO L280 TraceCheckUtils]: 11: Hoare triple {2976#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {2981#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-29 01:19:38,243 INFO L280 TraceCheckUtils]: 12: Hoare triple {2981#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L542-3 {2982#(= |main_#t~mem6| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:38,244 INFO L280 TraceCheckUtils]: 13: Hoare triple {2982#(= |main_#t~mem6| (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(3 != #t~mem6);havoc #t~mem6; {2983#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-29 01:19:38,244 INFO L280 TraceCheckUtils]: 14: Hoare triple {2983#(= 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; {2984#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-29 01:19:38,245 INFO L280 TraceCheckUtils]: 15: Hoare triple {2984#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem10 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L555-3 {2985#(= |main_#t~mem10| 3)} is VALID [2020-07-29 01:19:38,246 INFO L280 TraceCheckUtils]: 16: Hoare triple {2985#(= |main_#t~mem10| 3)} assume !!(3 != #t~mem10);havoc #t~mem10;~tmp~0.base, ~tmp~0.offset := ~p~0.base, ~p~0.offset; {2977#false} is VALID [2020-07-29 01:19:38,246 INFO L280 TraceCheckUtils]: 17: Hoare triple {2977#false} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L557 {2977#false} is VALID [2020-07-29 01:19:38,247 INFO L280 TraceCheckUtils]: 18: Hoare triple {2977#false} ~p~0.base, ~p~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {2977#false} is VALID [2020-07-29 01:19:38,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {2977#false} assume 0 == ~tmp~0.offset; {2977#false} is VALID [2020-07-29 01:19:38,247 INFO L280 TraceCheckUtils]: 20: Hoare triple {2977#false} assume !(~tmp~0.base < #StackHeapBarrier); {2977#false} is VALID [2020-07-29 01:19:38,248 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:38,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437989867] [2020-07-29 01:19:38,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:38,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 01:19:38,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690747964] [2020-07-29 01:19:38,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-29 01:19:38,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:38,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:19:38,280 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:38,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:19:38,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:38,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:19:38,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:19:38,281 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 8 states. [2020-07-29 01:19:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:39,116 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2020-07-29 01:19:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:39,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-29 01:19:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:19:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-29 01:19:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:19:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-29 01:19:39,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 121 transitions. [2020-07-29 01:19:39,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:39,275 INFO L225 Difference]: With dead ends: 115 [2020-07-29 01:19:39,275 INFO L226 Difference]: Without dead ends: 108 [2020-07-29 01:19:39,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-29 01:19:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2020-07-29 01:19:39,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:39,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 96 states. [2020-07-29 01:19:39,281 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 96 states. [2020-07-29 01:19:39,281 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 96 states. [2020-07-29 01:19:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:39,285 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-29 01:19:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-29 01:19:39,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:39,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:39,286 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 108 states. [2020-07-29 01:19:39,287 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 108 states. [2020-07-29 01:19:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:39,291 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-29 01:19:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-29 01:19:39,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:39,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:39,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:39,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-29 01:19:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2020-07-29 01:19:39,296 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 21 [2020-07-29 01:19:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:39,296 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2020-07-29 01:19:39,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:19:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2020-07-29 01:19:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:39,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:39,297 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:39,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:19:39,298 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash -404712455, now seen corresponding path program 1 times [2020-07-29 01:19:39,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:39,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300044031] [2020-07-29 01:19:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:39,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:39,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {3434#(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; {3425#true} is VALID [2020-07-29 01:19:39,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {3425#true} assume true; {3425#true} is VALID [2020-07-29 01:19:39,405 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3425#true} {3425#true} #157#return; {3425#true} is VALID [2020-07-29 01:19:39,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {3425#true} call ULTIMATE.init(); {3434#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:39,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {3434#(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; {3425#true} is VALID [2020-07-29 01:19:39,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {3425#true} assume true; {3425#true} is VALID [2020-07-29 01:19:39,407 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3425#true} {3425#true} #157#return; {3425#true} is VALID [2020-07-29 01:19:39,407 INFO L263 TraceCheckUtils]: 4: Hoare triple {3425#true} call #t~ret12 := main(); {3425#true} is VALID [2020-07-29 01:19:39,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {3425#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3425#true} is VALID [2020-07-29 01:19:39,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {3425#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3425#true} is VALID [2020-07-29 01:19:39,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {3425#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3425#true} is VALID [2020-07-29 01:19:39,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {3425#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3425#true} is VALID [2020-07-29 01:19:39,408 INFO L280 TraceCheckUtils]: 9: Hoare triple {3425#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {3425#true} is VALID [2020-07-29 01:19:39,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {3425#true} assume 0 != ~flag~0; {3425#true} is VALID [2020-07-29 01:19:39,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {3425#true} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L528 {3425#true} is VALID [2020-07-29 01:19:39,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {3425#true} ~flag~0 := 0; {3425#true} is VALID [2020-07-29 01:19:39,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {3425#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {3430#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:39,410 INFO L280 TraceCheckUtils]: 14: Hoare triple {3430#(= 1 (select |#valid| main_~t~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3430#(= 1 (select |#valid| main_~t~0.base))} is VALID [2020-07-29 01:19:39,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {3430#(= 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 {3431#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-29 01:19:39,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {3431#(= 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: L536 {3432#(= (select |#valid| |main_#t~mem5.base|) 1)} is VALID [2020-07-29 01:19:39,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {3432#(= (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; {3433#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:39,413 INFO L280 TraceCheckUtils]: 18: Hoare triple {3433#(= 1 (select |#valid| main_~p~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3433#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:39,414 INFO L280 TraceCheckUtils]: 19: Hoare triple {3433#(= 1 (select |#valid| main_~p~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {3433#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:19:39,414 INFO L280 TraceCheckUtils]: 20: Hoare triple {3433#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {3426#false} is VALID [2020-07-29 01:19:39,415 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:39,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300044031] [2020-07-29 01:19:39,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:39,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:39,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249378765] [2020-07-29 01:19:39,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:39,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:39,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:39,445 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:39,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:39,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:39,446 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2020-07-29 01:19:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,156 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-29 01:19:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:40,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-29 01:19:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-29 01:19:40,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2020-07-29 01:19:40,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:40,291 INFO L225 Difference]: With dead ends: 98 [2020-07-29 01:19:40,292 INFO L226 Difference]: Without dead ends: 98 [2020-07-29 01:19:40,292 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:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-29 01:19:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2020-07-29 01:19:40,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:40,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 93 states. [2020-07-29 01:19:40,297 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 93 states. [2020-07-29 01:19:40,297 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 93 states. [2020-07-29 01:19:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,301 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-29 01:19:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-29 01:19:40,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:40,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:40,303 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 98 states. [2020-07-29 01:19:40,303 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 98 states. [2020-07-29 01:19:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,306 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2020-07-29 01:19:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-29 01:19:40,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:40,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:40,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:40,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-29 01:19:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2020-07-29 01:19:40,312 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 21 [2020-07-29 01:19:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:40,312 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2020-07-29 01:19:40,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2020-07-29 01:19:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:40,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:40,313 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:40,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:19:40,314 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash -404712454, now seen corresponding path program 1 times [2020-07-29 01:19:40,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:40,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229108529] [2020-07-29 01:19:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:40,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:40,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#(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; {3831#true} is VALID [2020-07-29 01:19:40,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {3831#true} assume true; {3831#true} is VALID [2020-07-29 01:19:40,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3831#true} {3831#true} #157#return; {3831#true} is VALID [2020-07-29 01:19:40,471 INFO L263 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3840#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:40,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#(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; {3831#true} is VALID [2020-07-29 01:19:40,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2020-07-29 01:19:40,472 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #157#return; {3831#true} is VALID [2020-07-29 01:19:40,472 INFO L263 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret12 := main(); {3831#true} is VALID [2020-07-29 01:19:40,472 INFO L280 TraceCheckUtils]: 5: Hoare triple {3831#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3831#true} is VALID [2020-07-29 01:19:40,473 INFO L280 TraceCheckUtils]: 6: Hoare triple {3831#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3831#true} is VALID [2020-07-29 01:19:40,473 INFO L280 TraceCheckUtils]: 7: Hoare triple {3831#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3831#true} is VALID [2020-07-29 01:19:40,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {3831#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3831#true} is VALID [2020-07-29 01:19:40,473 INFO L280 TraceCheckUtils]: 9: Hoare triple {3831#true} assume !!(0 != #t~nondet3);havoc #t~nondet3; {3831#true} is VALID [2020-07-29 01:19:40,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {3831#true} assume 0 != ~flag~0; {3831#true} is VALID [2020-07-29 01:19:40,474 INFO L280 TraceCheckUtils]: 11: Hoare triple {3831#true} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L528 {3831#true} is VALID [2020-07-29 01:19:40,474 INFO L280 TraceCheckUtils]: 12: Hoare triple {3831#true} ~flag~0 := 0; {3831#true} is VALID [2020-07-29 01:19:40,477 INFO L280 TraceCheckUtils]: 13: Hoare triple {3831#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {3836#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:40,478 INFO L280 TraceCheckUtils]: 14: Hoare triple {3836#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3836#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-29 01:19:40,483 INFO L280 TraceCheckUtils]: 15: Hoare triple {3836#(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 {3837#(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:40,484 INFO L280 TraceCheckUtils]: 16: Hoare triple {3837#(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: L536 {3838#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} is VALID [2020-07-29 01:19:40,485 INFO L280 TraceCheckUtils]: 17: Hoare triple {3838#(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; {3839#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:40,486 INFO L280 TraceCheckUtils]: 18: Hoare triple {3839#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3839#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:40,493 INFO L280 TraceCheckUtils]: 19: Hoare triple {3839#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {3839#(and (= 8 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-29 01:19:40,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {3839#(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); {3832#false} is VALID [2020-07-29 01:19:40,498 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:40,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229108529] [2020-07-29 01:19:40,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:40,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:40,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488231186] [2020-07-29 01:19:40,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:40,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:40,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:40,523 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,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:40,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:40,524 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 7 states. [2020-07-29 01:19:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,350 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2020-07-29 01:19:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:41,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-29 01:19:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2020-07-29 01:19:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2020-07-29 01:19:41,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2020-07-29 01:19:41,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:41,479 INFO L225 Difference]: With dead ends: 89 [2020-07-29 01:19:41,479 INFO L226 Difference]: Without dead ends: 89 [2020-07-29 01:19:41,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-29 01:19:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2020-07-29 01:19:41,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:41,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 79 states. [2020-07-29 01:19:41,483 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 79 states. [2020-07-29 01:19:41,483 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 79 states. [2020-07-29 01:19:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,485 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2020-07-29 01:19:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2020-07-29 01:19:41,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,486 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 89 states. [2020-07-29 01:19:41,486 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 89 states. [2020-07-29 01:19:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,489 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2020-07-29 01:19:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2020-07-29 01:19:41,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:41,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-29 01:19:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2020-07-29 01:19:41,492 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 21 [2020-07-29 01:19:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:41,493 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2020-07-29 01:19:41,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2020-07-29 01:19:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-29 01:19:41,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:41,494 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:41,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:41,495 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:19:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1029325368, now seen corresponding path program 1 times [2020-07-29 01:19:41,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:41,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007948603] [2020-07-29 01:19:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:41,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:41,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:41,563 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:41,563 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:41,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-29 01:19:41,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:41 BoogieIcfgContainer [2020-07-29 01:19:41,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:41,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:41,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:41,602 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:41,603 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:31" (3/4) ... [2020-07-29 01:19:41,605 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:41,684 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:41,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:41,689 INFO L168 Benchmark]: Toolchain (without parser) took 11899.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -99.2 MB). Peak memory consumption was 219.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:41,690 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:41,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:41,693 INFO L168 Benchmark]: Boogie Preprocessor took 89.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:41,694 INFO L168 Benchmark]: RCFGBuilder took 859.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:41,695 INFO L168 Benchmark]: TraceAbstraction took 10200.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -15.7 MB). Peak memory consumption was 166.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:41,695 INFO L168 Benchmark]: Witness Printer took 83.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:41,705 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 657.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 859.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10200.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -15.7 MB). Peak memory consumption was 166.2 MB. Max. memory is 11.5 GB. * Witness Printer took 83.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 562]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L521] int flag = 1; [L522] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L523] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] List t; [L525] List p = a; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L528] p->h = 2 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L529] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L534] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L535] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L536] p->n = t VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L537] EXPR p->n VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L537] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L540] p = a [L541] flag = 1 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L542] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=2, t={-2:0}] [L542] COND TRUE p->h != 3 [L543] COND TRUE \read(flag) [L544] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L545] EXPR p->h VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=2, t={-2:0}] [L545] COND TRUE p->h != 1 [L562] __VERIFIER_error() VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 97 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 515 SDtfs, 845 SDslu, 902 SDs, 0 SdLazy, 1701 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 122 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 10974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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...