./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/forester-heap/sll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/forester-heap/sll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:09:28,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:09:28,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:09:28,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:09:28,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:09:28,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:09:28,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:09:28,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:09:28,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:09:28,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:09:28,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:09:28,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:09:28,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:09:28,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:09:28,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:09:28,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:09:28,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:09:28,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:09:28,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:09:28,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:09:28,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:09:28,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:09:28,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:09:28,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:09:28,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:09:28,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:09:28,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:09:28,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:09:28,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:09:28,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:09:28,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:09:28,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:09:28,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:09:28,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:09:28,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:09:28,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:09:28,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:09:28,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:09:28,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:09:28,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:09:28,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:09:28,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:09:28,509 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:09:28,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:09:28,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:09:28,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:09:28,513 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:09:28,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:09:28,514 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:09:28,514 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:09:28,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:09:28,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:09:28,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:09:28,516 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:09:28,516 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:09:28,517 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:09:28,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:09:28,518 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:09:28,518 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:09:28,518 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:09:28,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:09:28,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:09:28,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:09:28,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:09:28,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:09:28,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:09:28,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:09:28,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:09:28,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:09:28,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:09:28,521 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2020-07-29 01:09:28,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:09:28,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:09:28,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:09:28,900 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:09:28,900 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:09:28,901 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2020-07-29 01:09:28,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3430e4ec/75cc45c74348421a9eb906a2dfcefd05/FLAGe4336f28f [2020-07-29 01:09:29,499 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:09:29,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2020-07-29 01:09:29,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3430e4ec/75cc45c74348421a9eb906a2dfcefd05/FLAGe4336f28f [2020-07-29 01:09:29,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3430e4ec/75cc45c74348421a9eb906a2dfcefd05 [2020-07-29 01:09:29,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:09:29,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:09:29,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:09:29,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:09:29,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:09:29,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:09:29" (1/1) ... [2020-07-29 01:09:29,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ad77c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:29, skipping insertion in model container [2020-07-29 01:09:29,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:09:29" (1/1) ... [2020-07-29 01:09:29,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:09:29,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:09:30,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:09:30,404 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:09:30,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:09:30,553 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:09:30,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30 WrapperNode [2020-07-29 01:09:30,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:09:30,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:09:30,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:09:30,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:09:30,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (1/1) ... [2020-07-29 01:09:30,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:09:30,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:09:30,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:09:30,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:09:30,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09: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:09:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:09:30,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:09:30,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:09:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:09:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:09:30,758 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:09:30,758 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:09:30,758 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:09:30,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:09:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:09:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:09:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:09:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:09:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:09:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:09:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:09:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:09:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:09:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:09:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:09:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:09:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:09:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:09:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:09:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:09:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:09:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:09:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:09:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:09:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:09:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:09:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:09:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:09:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:09:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:09:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:09:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:09:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:09:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:09:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:09:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:09:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:09:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:09:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:09:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:09:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:09:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:09:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:09:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:09:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:09:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:09:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:09:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:09:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:09:30,775 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:09:30,775 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:09:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:09:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:09:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:09:30,776 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:09:30,777 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:09:30,778 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:09:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:09:30,779 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:09:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:09:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:09:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:09:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:09:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:09:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:09:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:09:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:09:30,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:09:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:09:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:09:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:09:31,664 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:09:31,664 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 01:09:31,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:09:31 BoogieIcfgContainer [2020-07-29 01:09:31,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:09:31,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:09:31,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:09:31,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:09:31,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:09:29" (1/3) ... [2020-07-29 01:09:31,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780cb2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:09:31, skipping insertion in model container [2020-07-29 01:09:31,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:30" (2/3) ... [2020-07-29 01:09:31,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780cb2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:09:31, skipping insertion in model container [2020-07-29 01:09:31,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:09:31" (3/3) ... [2020-07-29 01:09:31,679 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2020-07-29 01:09:31,690 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:09:31,699 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2020-07-29 01:09:31,715 INFO L251 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2020-07-29 01:09:31,737 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:09:31,738 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:09:31,738 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:09:31,738 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:09:31,738 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:09:31,739 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:09:31,739 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:09:31,739 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:09:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2020-07-29 01:09:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:09:31,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:31,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:31,772 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash 779799538, now seen corresponding path program 1 times [2020-07-29 01:09:31,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:31,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417107751] [2020-07-29 01:09:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:31,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:32,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {133#(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; {127#true} is VALID [2020-07-29 01:09:32,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {127#true} assume true; {127#true} is VALID [2020-07-29 01:09:32,022 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {127#true} {127#true} #208#return; {127#true} is VALID [2020-07-29 01:09:32,026 INFO L263 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {133#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:32,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#(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; {127#true} is VALID [2020-07-29 01:09:32,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2020-07-29 01:09:32,027 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #208#return; {127#true} is VALID [2020-07-29 01:09:32,027 INFO L263 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret17 := main(); {127#true} is VALID [2020-07-29 01:09:32,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {127#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {132#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-29 01:09:32,031 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#(= 1 (select |#valid| main_~list~0.base))} assume !(1 == #valid[~list~0.base]); {128#false} is VALID [2020-07-29 01:09:32,032 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:09:32,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417107751] [2020-07-29 01:09:32,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:32,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:09:32,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681669499] [2020-07-29 01:09:32,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:09:32,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:32,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:09:32,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:32,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:09:32,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:32,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:09:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:09:32,082 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2020-07-29 01:09:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:32,771 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:09:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:09:32,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:09:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2020-07-29 01:09:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2020-07-29 01:09:32,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 151 transitions. [2020-07-29 01:09:33,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:33,041 INFO L225 Difference]: With dead ends: 125 [2020-07-29 01:09:33,042 INFO L226 Difference]: Without dead ends: 121 [2020-07-29 01:09:33,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:09:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-07-29 01:09:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2020-07-29 01:09:33,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:33,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 117 states. [2020-07-29 01:09:33,089 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 117 states. [2020-07-29 01:09:33,090 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 117 states. [2020-07-29 01:09:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:33,100 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2020-07-29 01:09:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2020-07-29 01:09:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:33,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:33,103 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 121 states. [2020-07-29 01:09:33,103 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 121 states. [2020-07-29 01:09:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:33,113 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2020-07-29 01:09:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2020-07-29 01:09:33,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:33,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:33,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:33,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-29 01:09:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2020-07-29 01:09:33,125 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2020-07-29 01:09:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:33,125 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2020-07-29 01:09:33,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:09:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2020-07-29 01:09:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:09:33,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:33,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:33,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:09:33,128 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash 779799539, now seen corresponding path program 1 times [2020-07-29 01:09:33,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:33,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773816082] [2020-07-29 01:09:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:33,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:33,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {628#(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; {622#true} is VALID [2020-07-29 01:09:33,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2020-07-29 01:09:33,221 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #208#return; {622#true} is VALID [2020-07-29 01:09:33,222 INFO L263 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:33,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#(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; {622#true} is VALID [2020-07-29 01:09:33,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2020-07-29 01:09:33,223 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #208#return; {622#true} is VALID [2020-07-29 01:09:33,223 INFO L263 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret17 := main(); {622#true} is VALID [2020-07-29 01:09:33,224 INFO L280 TraceCheckUtils]: 5: Hoare triple {622#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {627#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)))} is VALID [2020-07-29 01:09:33,226 INFO L280 TraceCheckUtils]: 6: Hoare triple {627#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)))} assume !(4 + ~list~0.offset <= #length[~list~0.base] && 0 <= ~list~0.offset); {623#false} is VALID [2020-07-29 01:09:33,227 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:09:33,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773816082] [2020-07-29 01:09:33,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:33,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:09:33,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912156221] [2020-07-29 01:09:33,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:09:33,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:33,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:09:33,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:33,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:09:33,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:09:33,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:09:33,245 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 4 states. [2020-07-29 01:09:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:33,928 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2020-07-29 01:09:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:09:33,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:09:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2020-07-29 01:09:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2020-07-29 01:09:33,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2020-07-29 01:09:34,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:34,148 INFO L225 Difference]: With dead ends: 135 [2020-07-29 01:09:34,148 INFO L226 Difference]: Without dead ends: 135 [2020-07-29 01:09:34,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:09:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-29 01:09:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2020-07-29 01:09:34,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:34,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 122 states. [2020-07-29 01:09:34,158 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 122 states. [2020-07-29 01:09:34,158 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 122 states. [2020-07-29 01:09:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:34,165 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2020-07-29 01:09:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2020-07-29 01:09:34,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:34,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:34,167 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 135 states. [2020-07-29 01:09:34,168 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 135 states. [2020-07-29 01:09:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:34,175 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2020-07-29 01:09:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2020-07-29 01:09:34,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:34,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:34,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:34,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 01:09:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2020-07-29 01:09:34,183 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 7 [2020-07-29 01:09:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:34,184 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2020-07-29 01:09:34,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:09:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2020-07-29 01:09:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:09:34,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:34,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:34,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:09:34,185 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash -786113028, now seen corresponding path program 1 times [2020-07-29 01:09:34,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:34,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938123096] [2020-07-29 01:09:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:34,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:34,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {1165#(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; {1158#true} is VALID [2020-07-29 01:09:34,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-29 01:09:34,333 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1158#true} {1158#true} #208#return; {1158#true} is VALID [2020-07-29 01:09:34,337 INFO L263 TraceCheckUtils]: 0: Hoare triple {1158#true} call ULTIMATE.init(); {1165#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:34,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {1165#(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; {1158#true} is VALID [2020-07-29 01:09:34,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {1158#true} assume true; {1158#true} is VALID [2020-07-29 01:09:34,338 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1158#true} #208#return; {1158#true} is VALID [2020-07-29 01:09:34,339 INFO L263 TraceCheckUtils]: 4: Hoare triple {1158#true} call #t~ret17 := main(); {1158#true} is VALID [2020-07-29 01:09:34,339 INFO L280 TraceCheckUtils]: 5: Hoare triple {1158#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1158#true} is VALID [2020-07-29 01:09:34,340 INFO L280 TraceCheckUtils]: 6: Hoare triple {1158#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {1163#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-29 01:09:34,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {1163#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {1163#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-29 01:09:34,342 INFO L280 TraceCheckUtils]: 8: Hoare triple {1163#(= 1 (select |#valid| main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1164#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:34,343 INFO L280 TraceCheckUtils]: 9: Hoare triple {1164#(= 1 (select |#valid| main_~end~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1164#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:34,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {1164#(= 1 (select |#valid| main_~end~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {1164#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:34,345 INFO L280 TraceCheckUtils]: 11: Hoare triple {1164#(= 1 (select |#valid| main_~end~0.base))} assume !(1 == #valid[~end~0.base]); {1159#false} is VALID [2020-07-29 01:09:34,346 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:09:34,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938123096] [2020-07-29 01:09:34,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:34,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:09:34,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995850982] [2020-07-29 01:09:34,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:09:34,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:34,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:09:34,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:34,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:09:34,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:09:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:09:34,365 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 5 states. [2020-07-29 01:09:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:35,033 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2020-07-29 01:09:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:09:35,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:09:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:09:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2020-07-29 01:09:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:09:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2020-07-29 01:09:35,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 142 transitions. [2020-07-29 01:09:35,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:35,231 INFO L225 Difference]: With dead ends: 129 [2020-07-29 01:09:35,231 INFO L226 Difference]: Without dead ends: 129 [2020-07-29 01:09:35,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:09:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-29 01:09:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2020-07-29 01:09:35,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:35,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 114 states. [2020-07-29 01:09:35,248 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 114 states. [2020-07-29 01:09:35,249 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 114 states. [2020-07-29 01:09:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:35,268 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2020-07-29 01:09:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2020-07-29 01:09:35,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:35,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:35,270 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 129 states. [2020-07-29 01:09:35,270 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 129 states. [2020-07-29 01:09:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:35,285 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2020-07-29 01:09:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2020-07-29 01:09:35,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:35,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:35,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:35,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-29 01:09:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2020-07-29 01:09:35,293 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 12 [2020-07-29 01:09:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:35,294 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2020-07-29 01:09:35,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:09:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2020-07-29 01:09:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:09:35,294 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:35,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:35,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:09:35,295 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash -786113027, now seen corresponding path program 1 times [2020-07-29 01:09:35,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:35,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702626903] [2020-07-29 01:09:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:35,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:35,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {1680#(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; {1671#true} is VALID [2020-07-29 01:09:35,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2020-07-29 01:09:35,477 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #208#return; {1671#true} is VALID [2020-07-29 01:09:35,478 INFO L263 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1680#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:35,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {1680#(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; {1671#true} is VALID [2020-07-29 01:09:35,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2020-07-29 01:09:35,479 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #208#return; {1671#true} is VALID [2020-07-29 01:09:35,480 INFO L263 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret17 := main(); {1671#true} is VALID [2020-07-29 01:09:35,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {1671#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1676#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)))} is VALID [2020-07-29 01:09:35,486 INFO L280 TraceCheckUtils]: 6: Hoare triple {1676#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {1677#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 8 (select |#length| main_~list~0.base)))} is VALID [2020-07-29 01:09:35,487 INFO L280 TraceCheckUtils]: 7: Hoare triple {1677#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 8 (select |#length| main_~list~0.base)))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {1677#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 8 (select |#length| main_~list~0.base)))} is VALID [2020-07-29 01:09:35,488 INFO L280 TraceCheckUtils]: 8: Hoare triple {1677#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= 8 (select |#length| main_~list~0.base)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1678#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-29 01:09:35,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {1678#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1678#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-29 01:09:35,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {1678#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset) (= 1 (select |#valid| main_~end~0.base)))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {1679#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset))} is VALID [2020-07-29 01:09:35,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {1679#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset))} assume !(4 + ~end~0.offset <= #length[~end~0.base] && 0 <= ~end~0.offset); {1672#false} is VALID [2020-07-29 01:09:35,491 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:09:35,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702626903] [2020-07-29 01:09:35,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:35,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:09:35,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338450105] [2020-07-29 01:09:35,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-29 01:09:35,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:35,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:09:35,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:35,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:09:35,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:09:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:09:35,519 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2020-07-29 01:09:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:36,820 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2020-07-29 01:09:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:09:36,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-29 01:09:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-29 01:09:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2020-07-29 01:09:36,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2020-07-29 01:09:37,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:37,025 INFO L225 Difference]: With dead ends: 152 [2020-07-29 01:09:37,026 INFO L226 Difference]: Without dead ends: 152 [2020-07-29 01:09:37,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:09:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-29 01:09:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2020-07-29 01:09:37,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:37,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 123 states. [2020-07-29 01:09:37,034 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 123 states. [2020-07-29 01:09:37,034 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 123 states. [2020-07-29 01:09:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:37,040 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2020-07-29 01:09:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2020-07-29 01:09:37,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:37,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:37,042 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 152 states. [2020-07-29 01:09:37,042 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 152 states. [2020-07-29 01:09:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:37,048 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2020-07-29 01:09:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2020-07-29 01:09:37,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:37,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:37,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:37,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-29 01:09:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2020-07-29 01:09:37,054 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 12 [2020-07-29 01:09:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:37,054 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2020-07-29 01:09:37,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:09:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2020-07-29 01:09:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:09:37,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:37,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:37,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:09:37,056 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash 459604198, now seen corresponding path program 1 times [2020-07-29 01:09:37,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:37,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665930894] [2020-07-29 01:09:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:37,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:37,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {2271#(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; {2264#true} is VALID [2020-07-29 01:09:37,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {2264#true} assume true; {2264#true} is VALID [2020-07-29 01:09:37,161 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2264#true} {2264#true} #208#return; {2264#true} is VALID [2020-07-29 01:09:37,169 INFO L263 TraceCheckUtils]: 0: Hoare triple {2264#true} call ULTIMATE.init(); {2271#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:37,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {2271#(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; {2264#true} is VALID [2020-07-29 01:09:37,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {2264#true} assume true; {2264#true} is VALID [2020-07-29 01:09:37,170 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2264#true} {2264#true} #208#return; {2264#true} is VALID [2020-07-29 01:09:37,171 INFO L263 TraceCheckUtils]: 4: Hoare triple {2264#true} call #t~ret17 := main(); {2264#true} is VALID [2020-07-29 01:09:37,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {2264#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2269#(not (= 0 main_~list~0.base))} is VALID [2020-07-29 01:09:37,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {2269#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {2269#(not (= 0 main_~list~0.base))} is VALID [2020-07-29 01:09:37,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {2269#(not (= 0 main_~list~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {2269#(not (= 0 main_~list~0.base))} is VALID [2020-07-29 01:09:37,176 INFO L280 TraceCheckUtils]: 8: Hoare triple {2269#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2269#(not (= 0 main_~list~0.base))} is VALID [2020-07-29 01:09:37,177 INFO L280 TraceCheckUtils]: 9: Hoare triple {2269#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2269#(not (= 0 main_~list~0.base))} is VALID [2020-07-29 01:09:37,178 INFO L280 TraceCheckUtils]: 10: Hoare triple {2269#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {2269#(not (= 0 main_~list~0.base))} is VALID [2020-07-29 01:09:37,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {2269#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2270#(not (= 0 main_~end~0.base))} is VALID [2020-07-29 01:09:37,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {2270#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2265#false} is VALID [2020-07-29 01:09:37,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {2265#false} assume !false; {2265#false} is VALID [2020-07-29 01:09:37,181 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:09:37,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665930894] [2020-07-29 01:09:37,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:37,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:09:37,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575785631] [2020-07-29 01:09:37,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-29 01:09:37,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:37,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:09:37,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:37,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:09:37,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:09:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:09:37,201 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 5 states. [2020-07-29 01:09:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:37,804 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2020-07-29 01:09:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:09:37,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-29 01:09:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:09:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2020-07-29 01:09:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:09:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2020-07-29 01:09:37,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 147 transitions. [2020-07-29 01:09:37,990 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:09:37,993 INFO L225 Difference]: With dead ends: 137 [2020-07-29 01:09:37,993 INFO L226 Difference]: Without dead ends: 137 [2020-07-29 01:09:37,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:09:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-29 01:09:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2020-07-29 01:09:38,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:38,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 121 states. [2020-07-29 01:09:38,000 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 121 states. [2020-07-29 01:09:38,001 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 121 states. [2020-07-29 01:09:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:38,006 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2020-07-29 01:09:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2020-07-29 01:09:38,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:38,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:38,007 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 137 states. [2020-07-29 01:09:38,007 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 137 states. [2020-07-29 01:09:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:38,012 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2020-07-29 01:09:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2020-07-29 01:09:38,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:38,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:38,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:38,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:09:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2020-07-29 01:09:38,018 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 14 [2020-07-29 01:09:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:38,018 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2020-07-29 01:09:38,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:09:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2020-07-29 01:09:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:09:38,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:38,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:38,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:09:38,020 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:38,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1363441086, now seen corresponding path program 1 times [2020-07-29 01:09:38,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:38,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549692529] [2020-07-29 01:09:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:38,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:38,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {2817#(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; {2808#true} is VALID [2020-07-29 01:09:38,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {2808#true} assume true; {2808#true} is VALID [2020-07-29 01:09:38,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2808#true} {2808#true} #208#return; {2808#true} is VALID [2020-07-29 01:09:38,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {2808#true} call ULTIMATE.init(); {2817#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:38,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {2817#(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; {2808#true} is VALID [2020-07-29 01:09:38,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {2808#true} assume true; {2808#true} is VALID [2020-07-29 01:09:38,122 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2808#true} {2808#true} #208#return; {2808#true} is VALID [2020-07-29 01:09:38,122 INFO L263 TraceCheckUtils]: 4: Hoare triple {2808#true} call #t~ret17 := main(); {2808#true} is VALID [2020-07-29 01:09:38,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {2808#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2808#true} is VALID [2020-07-29 01:09:38,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {2808#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {2808#true} is VALID [2020-07-29 01:09:38,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {2808#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {2808#true} is VALID [2020-07-29 01:09:38,123 INFO L280 TraceCheckUtils]: 8: Hoare triple {2808#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2808#true} is VALID [2020-07-29 01:09:38,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {2808#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2808#true} is VALID [2020-07-29 01:09:38,125 INFO L280 TraceCheckUtils]: 10: Hoare triple {2808#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {2813#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-29 01:09:38,126 INFO L280 TraceCheckUtils]: 11: Hoare triple {2813#(= (select |#valid| |main_#t~malloc2.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1005 {2814#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-29 01:09:38,127 INFO L280 TraceCheckUtils]: 12: Hoare triple {2814#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005-1 {2815#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 01:09:38,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {2815#(= 1 (select |#valid| |main_#t~mem3.base|))} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {2816#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:38,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {2816#(= 1 (select |#valid| main_~end~0.base))} assume !(1 == #valid[~end~0.base]); {2809#false} is VALID [2020-07-29 01:09:38,130 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:09:38,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549692529] [2020-07-29 01:09:38,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:38,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:09:38,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807773327] [2020-07-29 01:09:38,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:09:38,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:38,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:09:38,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:38,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:09:38,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:09:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:09:38,150 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 7 states. [2020-07-29 01:09:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:39,463 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2020-07-29 01:09:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:09:39,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:09:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2020-07-29 01:09:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2020-07-29 01:09:39,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 164 transitions. [2020-07-29 01:09:39,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:39,679 INFO L225 Difference]: With dead ends: 176 [2020-07-29 01:09:39,680 INFO L226 Difference]: Without dead ends: 176 [2020-07-29 01:09:39,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:09:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-07-29 01:09:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 120. [2020-07-29 01:09:39,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:39,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 120 states. [2020-07-29 01:09:39,688 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 120 states. [2020-07-29 01:09:39,688 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 120 states. [2020-07-29 01:09:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:39,695 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2020-07-29 01:09:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2020-07-29 01:09:39,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:39,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:39,696 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 176 states. [2020-07-29 01:09:39,697 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 176 states. [2020-07-29 01:09:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:39,703 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2020-07-29 01:09:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2020-07-29 01:09:39,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:39,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:39,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:39,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-29 01:09:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2020-07-29 01:09:39,710 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 15 [2020-07-29 01:09:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:39,711 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2020-07-29 01:09:39,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:09:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2020-07-29 01:09:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:09:39,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:39,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:39,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:09:39,713 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1363441087, now seen corresponding path program 1 times [2020-07-29 01:09:39,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:39,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045239891] [2020-07-29 01:09:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:39,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:39,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {3484#(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; {3475#true} is VALID [2020-07-29 01:09:39,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {3475#true} assume true; {3475#true} is VALID [2020-07-29 01:09:39,849 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3475#true} {3475#true} #208#return; {3475#true} is VALID [2020-07-29 01:09:39,850 INFO L263 TraceCheckUtils]: 0: Hoare triple {3475#true} call ULTIMATE.init(); {3484#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:39,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {3484#(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; {3475#true} is VALID [2020-07-29 01:09:39,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {3475#true} assume true; {3475#true} is VALID [2020-07-29 01:09:39,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3475#true} {3475#true} #208#return; {3475#true} is VALID [2020-07-29 01:09:39,852 INFO L263 TraceCheckUtils]: 4: Hoare triple {3475#true} call #t~ret17 := main(); {3475#true} is VALID [2020-07-29 01:09:39,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {3475#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {3475#true} is VALID [2020-07-29 01:09:39,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {3475#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {3475#true} is VALID [2020-07-29 01:09:39,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {3475#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {3475#true} is VALID [2020-07-29 01:09:39,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {3475#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3475#true} is VALID [2020-07-29 01:09:39,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {3475#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3475#true} is VALID [2020-07-29 01:09:39,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {3475#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {3480#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)))} is VALID [2020-07-29 01:09:39,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {3480#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1005 {3481#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))} is VALID [2020-07-29 01:09:39,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {3481#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005-1 {3482#(and (= 8 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} is VALID [2020-07-29 01:09:39,860 INFO L280 TraceCheckUtils]: 13: Hoare triple {3482#(and (= 8 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {3483#(and (= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset))} is VALID [2020-07-29 01:09:39,861 INFO L280 TraceCheckUtils]: 14: Hoare triple {3483#(and (= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset))} assume !(4 + ~end~0.offset <= #length[~end~0.base] && 0 <= ~end~0.offset); {3476#false} is VALID [2020-07-29 01:09:39,863 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:09:39,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045239891] [2020-07-29 01:09:39,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:39,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:09:39,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622823420] [2020-07-29 01:09:39,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:09:39,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:39,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:09:39,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:39,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:09:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:39,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:09:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:09:39,913 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 7 states. [2020-07-29 01:09:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:41,514 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2020-07-29 01:09:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:09:41,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:09:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2020-07-29 01:09:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2020-07-29 01:09:41,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 181 transitions. [2020-07-29 01:09:41,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:41,724 INFO L225 Difference]: With dead ends: 202 [2020-07-29 01:09:41,724 INFO L226 Difference]: Without dead ends: 202 [2020-07-29 01:09:41,725 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:09:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-29 01:09:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 115. [2020-07-29 01:09:41,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:41,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 115 states. [2020-07-29 01:09:41,730 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 115 states. [2020-07-29 01:09:41,731 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 115 states. [2020-07-29 01:09:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:41,737 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2020-07-29 01:09:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2020-07-29 01:09:41,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:41,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:41,739 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 202 states. [2020-07-29 01:09:41,739 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 202 states. [2020-07-29 01:09:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:41,746 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2020-07-29 01:09:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2020-07-29 01:09:41,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:41,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:41,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:41,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-29 01:09:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2020-07-29 01:09:41,751 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 15 [2020-07-29 01:09:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:41,751 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2020-07-29 01:09:41,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:09:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2020-07-29 01:09:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:09:41,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:41,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:41,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:09:41,752 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -283093815, now seen corresponding path program 1 times [2020-07-29 01:09:41,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:41,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126498822] [2020-07-29 01:09:41,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:41,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:41,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {4228#(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; {4219#true} is VALID [2020-07-29 01:09:41,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-29 01:09:41,913 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4219#true} {4219#true} #208#return; {4219#true} is VALID [2020-07-29 01:09:41,915 INFO L263 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4228#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:41,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {4228#(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; {4219#true} is VALID [2020-07-29 01:09:41,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2020-07-29 01:09:41,916 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #208#return; {4219#true} is VALID [2020-07-29 01:09:41,916 INFO L263 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret17 := main(); {4219#true} is VALID [2020-07-29 01:09:41,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {4219#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4224#(= 0 main_~list~0.offset)} is VALID [2020-07-29 01:09:41,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {4224#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {4224#(= 0 main_~list~0.offset)} is VALID [2020-07-29 01:09:41,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {4224#(= 0 main_~list~0.offset)} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-29 01:09:41,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-29 01:09:41,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-29 01:09:41,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet1);havoc #t~nondet1; {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-29 01:09:41,924 INFO L280 TraceCheckUtils]: 11: Hoare triple {4225#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4226#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-29 01:09:41,925 INFO L280 TraceCheckUtils]: 12: Hoare triple {4226#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4226#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-29 01:09:41,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {4226#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {4226#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-29 01:09:41,927 INFO L280 TraceCheckUtils]: 14: Hoare triple {4226#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1028-4 {4227#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-29 01:09:41,927 INFO L280 TraceCheckUtils]: 15: Hoare triple {4227#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {4220#false} is VALID [2020-07-29 01:09:41,928 INFO L280 TraceCheckUtils]: 16: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2020-07-29 01:09:41,929 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:09:41,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126498822] [2020-07-29 01:09:41,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:41,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:09:41,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426514863] [2020-07-29 01:09:41,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-29 01:09:41,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:41,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:09:41,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:41,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:09:41,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:41,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:09:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:09:41,954 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 7 states. [2020-07-29 01:09:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:42,825 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2020-07-29 01:09:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:09:42,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-29 01:09:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2020-07-29 01:09:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:09:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2020-07-29 01:09:42,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 176 transitions. [2020-07-29 01:09:43,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:43,070 INFO L225 Difference]: With dead ends: 178 [2020-07-29 01:09:43,071 INFO L226 Difference]: Without dead ends: 178 [2020-07-29 01:09:43,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:09:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-29 01:09:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 122. [2020-07-29 01:09:43,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:43,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 122 states. [2020-07-29 01:09:43,081 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 122 states. [2020-07-29 01:09:43,083 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 122 states. [2020-07-29 01:09:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:43,099 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2020-07-29 01:09:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2020-07-29 01:09:43,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:43,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:43,100 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 178 states. [2020-07-29 01:09:43,100 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 178 states. [2020-07-29 01:09:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:43,105 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2020-07-29 01:09:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2020-07-29 01:09:43,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:43,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:43,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:43,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 01:09:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2020-07-29 01:09:43,110 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 17 [2020-07-29 01:09:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:43,111 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2020-07-29 01:09:43,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:09:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2020-07-29 01:09:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:09:43,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:43,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:43,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:09:43,121 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -132099760, now seen corresponding path program 1 times [2020-07-29 01:09:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:43,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157543269] [2020-07-29 01:09:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:43,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:09:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:43,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {4901#(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; {4893#true} is VALID [2020-07-29 01:09:43,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {4893#true} assume true; {4893#true} is VALID [2020-07-29 01:09:43,334 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4893#true} {4893#true} #208#return; {4893#true} is VALID [2020-07-29 01:09:43,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {4893#true} call ULTIMATE.init(); {4901#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:09:43,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {4901#(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; {4893#true} is VALID [2020-07-29 01:09:43,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {4893#true} assume true; {4893#true} is VALID [2020-07-29 01:09:43,337 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4893#true} {4893#true} #208#return; {4893#true} is VALID [2020-07-29 01:09:43,337 INFO L263 TraceCheckUtils]: 4: Hoare triple {4893#true} call #t~ret17 := main(); {4893#true} is VALID [2020-07-29 01:09:43,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {4893#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4893#true} is VALID [2020-07-29 01:09:43,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {4893#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {4893#true} is VALID [2020-07-29 01:09:43,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {4893#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {4893#true} is VALID [2020-07-29 01:09:43,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {4893#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4893#true} is VALID [2020-07-29 01:09:43,339 INFO L280 TraceCheckUtils]: 9: Hoare triple {4893#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4893#true} is VALID [2020-07-29 01:09:43,339 INFO L280 TraceCheckUtils]: 10: Hoare triple {4893#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {4893#true} is VALID [2020-07-29 01:09:43,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {4893#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4893#true} is VALID [2020-07-29 01:09:43,340 INFO L280 TraceCheckUtils]: 12: Hoare triple {4893#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4893#true} is VALID [2020-07-29 01:09:43,340 INFO L280 TraceCheckUtils]: 13: Hoare triple {4893#true} goto; {4893#true} is VALID [2020-07-29 01:09:43,341 INFO L280 TraceCheckUtils]: 14: Hoare triple {4893#true} SUMMARY for call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1028-4 {4898#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|)} is VALID [2020-07-29 01:09:43,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {4898#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|)} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {4899#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-29 01:09:43,343 INFO L280 TraceCheckUtils]: 16: Hoare triple {4899#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {4899#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-29 01:09:43,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {4899#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4899#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-29 01:09:43,345 INFO L280 TraceCheckUtils]: 18: Hoare triple {4899#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1032 {4900#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-29 01:09:43,347 INFO L280 TraceCheckUtils]: 19: Hoare triple {4900#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8; {4894#false} is VALID [2020-07-29 01:09:43,347 INFO L280 TraceCheckUtils]: 20: Hoare triple {4894#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1034 {4894#false} is VALID [2020-07-29 01:09:43,348 INFO L280 TraceCheckUtils]: 21: Hoare triple {4894#false} ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4894#false} is VALID [2020-07-29 01:09:43,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {4894#false} assume !(1 == #valid[~end~0.base]); {4894#false} is VALID [2020-07-29 01:09:43,350 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:09:43,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157543269] [2020-07-29 01:09:43,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:43,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:09:43,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960886876] [2020-07-29 01:09:43,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-29 01:09:43,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:43,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:09:43,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:43,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:09:43,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:09:43,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:09:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:09:43,379 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2020-07-29 01:09:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:44,080 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2020-07-29 01:09:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:09:44,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-29 01:09:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:09:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2020-07-29 01:09:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:09:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2020-07-29 01:09:44,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 116 transitions. [2020-07-29 01:09:44,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:44,222 INFO L225 Difference]: With dead ends: 127 [2020-07-29 01:09:44,222 INFO L226 Difference]: Without dead ends: 127 [2020-07-29 01:09:44,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:09:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-29 01:09:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2020-07-29 01:09:44,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:44,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 121 states. [2020-07-29 01:09:44,226 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 121 states. [2020-07-29 01:09:44,226 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 121 states. [2020-07-29 01:09:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:44,229 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2020-07-29 01:09:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2020-07-29 01:09:44,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:44,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:44,231 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 127 states. [2020-07-29 01:09:44,231 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 127 states. [2020-07-29 01:09:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:44,234 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2020-07-29 01:09:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2020-07-29 01:09:44,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:44,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:44,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:44,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:09:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2020-07-29 01:09:44,238 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 23 [2020-07-29 01:09:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:44,239 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2020-07-29 01:09:44,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:09:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2020-07-29 01:09:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:09:44,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:44,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:44,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:09:44,241 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash -131788878, now seen corresponding path program 1 times [2020-07-29 01:09:44,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:09:44,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091765515] [2020-07-29 01:09:44,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:09:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:09:44,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:09:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:09:44,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:09:44,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:09:44,295 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:09:44,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:09:44,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:09:44 BoogieIcfgContainer [2020-07-29 01:09:44,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:09:44,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:09:44,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:09:44,329 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:09:44,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:09:31" (3/4) ... [2020-07-29 01:09:44,336 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:09:44,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:09:44,339 INFO L168 Benchmark]: Toolchain (without parser) took 14505.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -225.0 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:09:44,339 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:09:44,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:09:44,341 INFO L168 Benchmark]: Boogie Preprocessor took 134.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:09:44,342 INFO L168 Benchmark]: RCFGBuilder took 979.00 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: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:09:44,342 INFO L168 Benchmark]: TraceAbstraction took 12656.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -162.4 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:09:44,343 INFO L168 Benchmark]: Witness Printer took 7.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:09:44,346 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.57 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 721.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 979.00 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: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12656.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -162.4 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1038. Possible FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L997] list->colour = BLACK VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L999] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1028] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1032] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 55 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 695 SDtfs, 1179 SDslu, 1055 SDs, 0 SdLazy, 2576 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 282 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 6781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:09:46,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:09:46,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:09:46,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:09:46,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:09:46,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:09:46,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:09:46,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:09:46,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:09:46,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:09:46,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:09:46,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:09:46,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:09:46,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:09:46,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:09:46,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:09:46,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:09:46,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:09:46,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:09:46,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:09:46,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:09:46,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:09:46,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:09:46,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:09:46,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:09:46,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:09:46,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:09:46,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:09:46,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:09:46,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:09:46,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:09:46,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:09:46,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:09:46,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:09:46,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:09:46,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:09:46,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:09:46,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:09:46,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:09:46,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:09:46,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:09:46,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:09:46,347 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:09:46,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:09:46,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:09:46,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:09:46,349 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:09:46,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:09:46,350 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:09:46,350 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:09:46,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:09:46,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:09:46,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:09:46,351 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:09:46,351 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:09:46,351 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:09:46,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:09:46,352 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:09:46,352 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:09:46,352 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:09:46,353 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:09:46,353 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:09:46,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:09:46,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:09:46,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:09:46,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:09:46,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:09:46,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:09:46,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:09:46,355 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:09:46,355 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:09:46,355 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:09:46,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:09:46,356 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2020-07-29 01:09:46,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:09:46,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:09:46,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:09:46,718 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:09:46,719 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:09:46,720 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2020-07-29 01:09:46,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531e14726/8a01d640259d4a31bbdbc8dd1e52551b/FLAGe6f2f9e95 [2020-07-29 01:09:47,389 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:09:47,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2020-07-29 01:09:47,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531e14726/8a01d640259d4a31bbdbc8dd1e52551b/FLAGe6f2f9e95 [2020-07-29 01:09:47,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531e14726/8a01d640259d4a31bbdbc8dd1e52551b [2020-07-29 01:09:47,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:09:47,595 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:09:47,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:09:47,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:09:47,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:09:47,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:09:47" (1/1) ... [2020-07-29 01:09:47,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ca22ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:47, skipping insertion in model container [2020-07-29 01:09:47,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:09:47" (1/1) ... [2020-07-29 01:09:47,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:09:47,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:09:48,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:09:48,154 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:09:48,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:09:48,309 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:09:48,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48 WrapperNode [2020-07-29 01:09:48,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:09:48,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:09:48,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:09:48,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:09:48,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (1/1) ... [2020-07-29 01:09:48,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:09:48,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:09:48,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:09:48,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:09:48,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (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:09:48,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:09:48,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:09:48,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:09:48,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:09:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:09:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:09:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:09:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:09:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:09:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:09:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:09:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:09:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:09:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:09:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:09:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:09:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:09:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:09:48,497 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:09:48,497 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:09:48,497 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:09:48,497 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:09:48,497 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:09:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:09:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:09:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:09:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:09:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:09:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:09:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:09:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:09:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:09:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:09:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:09:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:09:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:09:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:09:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:09:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:09:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:09:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:09:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:09:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:09:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:09:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:09:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:09:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:09:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:09:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:09:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:09:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:09:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:09:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:09:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:09:48,512 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:09:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:09:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:09:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:09:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:09:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:09:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:09:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:09:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:09:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:09:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:09:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:09:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:09:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:09:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:09:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:09:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:09:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:09:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:09:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:09:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:09:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:09:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:09:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:09:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:09:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:09:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:09:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:09:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:09:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:09:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:09:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:09:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:09:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:09:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:09:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:09:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:09:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:09:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:09:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:09:48,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:09:49,940 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:09:49,941 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 01:09:49,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:09:49 BoogieIcfgContainer [2020-07-29 01:09:49,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:09:49,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:09:49,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:09:49,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:09:49,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:09:47" (1/3) ... [2020-07-29 01:09:49,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c598f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:09:49, skipping insertion in model container [2020-07-29 01:09:49,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:09:48" (2/3) ... [2020-07-29 01:09:49,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c598f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:09:49, skipping insertion in model container [2020-07-29 01:09:49,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:09:49" (3/3) ... [2020-07-29 01:09:49,957 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2020-07-29 01:09:49,968 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:09:49,977 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2020-07-29 01:09:49,991 INFO L251 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2020-07-29 01:09:50,010 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:09:50,010 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:09:50,010 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:09:50,010 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:09:50,011 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:09:50,011 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:09:50,011 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:09:50,011 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:09:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2020-07-29 01:09:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:09:50,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:50,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:50,044 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2000778502, now seen corresponding path program 1 times [2020-07-29 01:09:50,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:09:50,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489714332] [2020-07-29 01:09:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:09:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:50,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:09:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:50,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:09:50,354 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:09:50,354 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:50,368 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:50,368 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:09:50,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:09:50,373 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:09:50,373 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_66|]. (= |#valid| (store |v_#valid_66| main_~list~0.base (_ bv1 1))) [2020-07-29 01:09:50,374 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| main_~list~0.base) (_ bv1 1)) [2020-07-29 01:09:50,398 INFO L263 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2020-07-29 01:09:50,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {125#true} is VALID [2020-07-29 01:09:50,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2020-07-29 01:09:50,400 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #228#return; {125#true} is VALID [2020-07-29 01:09:50,400 INFO L263 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret17 := main(); {125#true} is VALID [2020-07-29 01:09:50,403 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {145#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:50,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {145#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[~list~0.base]); {126#false} is VALID [2020-07-29 01:09:50,406 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:09:50,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:09:50,443 INFO L280 TraceCheckUtils]: 6: Hoare triple {145#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[~list~0.base]); {126#false} is VALID [2020-07-29 01:09:50,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {145#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:50,445 INFO L263 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret17 := main(); {125#true} is VALID [2020-07-29 01:09:50,446 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #228#return; {125#true} is VALID [2020-07-29 01:09:50,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2020-07-29 01:09:50,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {125#true} is VALID [2020-07-29 01:09:50,447 INFO L263 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2020-07-29 01:09:50,448 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:09:50,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489714332] [2020-07-29 01:09:50,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:50,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-29 01:09:50,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645813342] [2020-07-29 01:09:50,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:09:50,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:50,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:09:50,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:50,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:09:50,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:09:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:09:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:09:50,501 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2020-07-29 01:09:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:51,222 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2020-07-29 01:09:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:09:51,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:09:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:09:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-29 01:09:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:09:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-29 01:09:51,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2020-07-29 01:09:51,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:51,578 INFO L225 Difference]: With dead ends: 123 [2020-07-29 01:09:51,578 INFO L226 Difference]: Without dead ends: 119 [2020-07-29 01:09:51,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:09:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-29 01:09:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2020-07-29 01:09:51,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:51,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 115 states. [2020-07-29 01:09:51,625 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 115 states. [2020-07-29 01:09:51,626 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 115 states. [2020-07-29 01:09:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:51,637 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2020-07-29 01:09:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2020-07-29 01:09:51,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:51,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:51,639 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 119 states. [2020-07-29 01:09:51,639 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 119 states. [2020-07-29 01:09:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:51,650 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2020-07-29 01:09:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2020-07-29 01:09:51,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:51,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:51,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:51,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-29 01:09:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2020-07-29 01:09:51,662 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 7 [2020-07-29 01:09:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:51,667 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2020-07-29 01:09:51,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:09:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2020-07-29 01:09:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:09:51,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:51,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:51,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:09:51,872 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2000778503, now seen corresponding path program 1 times [2020-07-29 01:09:51,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:09:51,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509454120] [2020-07-29 01:09:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:09:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:51,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:09:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:51,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:09:52,000 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:09:52,000 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:52,009 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:52,010 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:09:52,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:09:52,016 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:09:52,016 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_52|]. (and (= (_ bv0 32) main_~list~0.offset) (= (store |v_#length_52| main_~list~0.base (_ bv8 32)) |#length|)) [2020-07-29 01:09:52,017 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset)) [2020-07-29 01:09:52,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2020-07-29 01:09:52,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {645#true} is VALID [2020-07-29 01:09:52,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-29 01:09:52,033 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #228#return; {645#true} is VALID [2020-07-29 01:09:52,034 INFO L263 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret17 := main(); {645#true} is VALID [2020-07-29 01:09:52,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {665#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset))} is VALID [2020-07-29 01:09:52,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset))} assume !((~bvule32(~bvadd32(4bv32, ~list~0.offset), #length[~list~0.base]) && ~bvule32(~list~0.offset, ~bvadd32(4bv32, ~list~0.offset))) && ~bvule32(0bv32, ~list~0.offset)); {646#false} is VALID [2020-07-29 01:09:52,039 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:09:52,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:09:52,128 INFO L280 TraceCheckUtils]: 6: Hoare triple {669#(and (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select |#length| main_~list~0.base)))} assume !((~bvule32(~bvadd32(4bv32, ~list~0.offset), #length[~list~0.base]) && ~bvule32(~list~0.offset, ~bvadd32(4bv32, ~list~0.offset))) && ~bvule32(0bv32, ~list~0.offset)); {646#false} is VALID [2020-07-29 01:09:52,132 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {669#(and (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select |#length| main_~list~0.base)))} is VALID [2020-07-29 01:09:52,132 INFO L263 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret17 := main(); {645#true} is VALID [2020-07-29 01:09:52,132 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #228#return; {645#true} is VALID [2020-07-29 01:09:52,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-29 01:09:52,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {645#true} is VALID [2020-07-29 01:09:52,134 INFO L263 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2020-07-29 01:09:52,134 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:09:52,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509454120] [2020-07-29 01:09:52,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:52,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-29 01:09:52,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644320106] [2020-07-29 01:09:52,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:09:52,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:52,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:09:52,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:52,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:09:52,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:09:52,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:09:52,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:09:52,158 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 4 states. [2020-07-29 01:09:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:53,122 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2020-07-29 01:09:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:09:53,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:09:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2020-07-29 01:09:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2020-07-29 01:09:53,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2020-07-29 01:09:53,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:53,433 INFO L225 Difference]: With dead ends: 133 [2020-07-29 01:09:53,434 INFO L226 Difference]: Without dead ends: 133 [2020-07-29 01:09:53,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:09:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-29 01:09:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2020-07-29 01:09:53,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:53,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 120 states. [2020-07-29 01:09:53,455 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 120 states. [2020-07-29 01:09:53,455 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 120 states. [2020-07-29 01:09:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:53,462 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2020-07-29 01:09:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2020-07-29 01:09:53,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:53,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:53,474 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 133 states. [2020-07-29 01:09:53,474 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 133 states. [2020-07-29 01:09:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:53,488 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2020-07-29 01:09:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2020-07-29 01:09:53,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:53,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:53,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:53,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-29 01:09:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2020-07-29 01:09:53,497 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 7 [2020-07-29 01:09:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:53,497 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2020-07-29 01:09:53,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:09:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-29 01:09:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:09:53,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:53,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:53,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:09:53,715 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:53,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1607638602, now seen corresponding path program 1 times [2020-07-29 01:09:53,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:09:53,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724935298] [2020-07-29 01:09:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:09:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:53,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:09:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:53,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:09:53,870 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:09:53,871 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:53,874 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:53,875 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:09:53,876 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:09:53,879 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:09:53,879 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_75|]. (= |#valid| (store |v_#valid_75| main_~list~0.base (_ bv1 1))) [2020-07-29 01:09:53,879 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| main_~list~0.base) (_ bv1 1)) [2020-07-29 01:09:53,939 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:53,940 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-07-29 01:09:53,941 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:53,958 INFO L624 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-07-29 01:09:53,959 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:09:53,959 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-07-29 01:09:53,964 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:09:53,964 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_76|, |main_#t~malloc2.base|]. (and (= |#valid| (store |v_#valid_76| |main_#t~malloc2.base| (_ bv1 1))) (= (_ bv1 1) (select |v_#valid_76| main_~end~0.base))) [2020-07-29 01:09:53,965 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|]. (and (= (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) (= (select |#valid| main_~end~0.base) (_ bv1 1))) [2020-07-29 01:09:53,978 INFO L263 TraceCheckUtils]: 0: Hoare triple {1209#true} call ULTIMATE.init(); {1209#true} is VALID [2020-07-29 01:09:53,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {1209#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1209#true} is VALID [2020-07-29 01:09:53,978 INFO L280 TraceCheckUtils]: 2: Hoare triple {1209#true} assume true; {1209#true} is VALID [2020-07-29 01:09:53,979 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1209#true} {1209#true} #228#return; {1209#true} is VALID [2020-07-29 01:09:53,979 INFO L263 TraceCheckUtils]: 4: Hoare triple {1209#true} call #t~ret17 := main(); {1209#true} is VALID [2020-07-29 01:09:53,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {1209#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:53,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:53,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:53,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:53,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:53,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !(1bv1 == #valid[~end~0.base]); {1210#false} is VALID [2020-07-29 01:09:53,986 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:09:53,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:09:54,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !(1bv1 == #valid[~end~0.base]); {1210#false} is VALID [2020-07-29 01:09:54,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:54,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1239#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:09:54,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:54,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:54,053 INFO L280 TraceCheckUtils]: 5: Hoare triple {1209#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1229#(= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:09:54,053 INFO L263 TraceCheckUtils]: 4: Hoare triple {1209#true} call #t~ret17 := main(); {1209#true} is VALID [2020-07-29 01:09:54,053 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1209#true} {1209#true} #228#return; {1209#true} is VALID [2020-07-29 01:09:54,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {1209#true} assume true; {1209#true} is VALID [2020-07-29 01:09:54,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {1209#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1209#true} is VALID [2020-07-29 01:09:54,054 INFO L263 TraceCheckUtils]: 0: Hoare triple {1209#true} call ULTIMATE.init(); {1209#true} is VALID [2020-07-29 01:09:54,055 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:09:54,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724935298] [2020-07-29 01:09:54,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:09:54,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-29 01:09:54,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546676011] [2020-07-29 01:09:54,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:09:54,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:09:54,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:09:54,075 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:09:54,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:09:54,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:09:54,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:09:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:09:54,077 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 4 states. [2020-07-29 01:09:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:54,878 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2020-07-29 01:09:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:09:54,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:09:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:09:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2020-07-29 01:09:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:09:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2020-07-29 01:09:54,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 140 transitions. [2020-07-29 01:09:55,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:09:55,133 INFO L225 Difference]: With dead ends: 127 [2020-07-29 01:09:55,133 INFO L226 Difference]: Without dead ends: 127 [2020-07-29 01:09:55,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:09:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-29 01:09:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2020-07-29 01:09:55,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:09:55,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 112 states. [2020-07-29 01:09:55,141 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 112 states. [2020-07-29 01:09:55,141 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 112 states. [2020-07-29 01:09:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:55,150 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2020-07-29 01:09:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2020-07-29 01:09:55,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:55,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:55,151 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 127 states. [2020-07-29 01:09:55,151 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 127 states. [2020-07-29 01:09:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:09:55,159 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2020-07-29 01:09:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2020-07-29 01:09:55,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:09:55,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:09:55,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:09:55,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:09:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-29 01:09:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2020-07-29 01:09:55,167 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2020-07-29 01:09:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:09:55,168 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2020-07-29 01:09:55,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:09:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2020-07-29 01:09:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:09:55,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:09:55,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:09:55,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:09:55,385 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:09:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:09:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1607638603, now seen corresponding path program 1 times [2020-07-29 01:09:55,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:09:55,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288274768] [2020-07-29 01:09:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:09:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:55,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:09:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:09:55,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:09:55,508 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:09:55,509 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:55,517 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:55,521 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:09:55,522 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:55,531 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:55,532 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:09:55,533 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-07-29 01:09:55,538 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:09:55,538 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_56|, |v_#valid_82|]. (and (= (store |v_#length_56| main_~list~0.base (_ bv8 32)) |#length|) (= (_ bv0 32) main_~list~0.offset) (= |#valid| (store |v_#valid_82| main_~list~0.base (_ bv1 1)))) [2020-07-29 01:09:55,538 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) (_ bv1 1)) (= (_ bv0 32) main_~list~0.offset)) [2020-07-29 01:09:55,644 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:55,645 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-29 01:09:55,646 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:55,670 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:55,678 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-29 01:09:55,680 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:09:55,690 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:09:55,692 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:09:55,692 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2020-07-29 01:09:55,698 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:09:55,699 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_57|, |main_#t~malloc2.base|, |v_#valid_83|]. (and (= (select |v_#valid_83| |main_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 32) (bvadd (select |v_#length_57| main_~end~0.base) (_ bv4294967288 32))) (= (_ bv0 32) main_~end~0.offset) (= (_ bv1 1) (select |v_#valid_83| main_~end~0.base)) (= |#length| (store |v_#length_57| |main_#t~malloc2.base| (_ bv8 32)))) [2020-07-29 01:09:55,699 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|]. (and (= (select |#length| |main_#t~malloc2.base|) (_ bv8 32)) (not (= main_~end~0.base |main_#t~malloc2.base|)) (= (_ bv0 32) main_~end~0.offset) (= (select |#length| main_~end~0.base) (_ bv8 32))) [2020-07-29 01:09:55,730 INFO L263 TraceCheckUtils]: 0: Hoare triple {1773#true} call ULTIMATE.init(); {1773#true} is VALID [2020-07-29 01:09:55,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {1773#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1773#true} is VALID [2020-07-29 01:09:55,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {1773#true} assume true; {1773#true} is VALID [2020-07-29 01:09:55,731 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1773#true} {1773#true} #228#return; {1773#true} is VALID [2020-07-29 01:09:55,731 INFO L263 TraceCheckUtils]: 4: Hoare triple {1773#true} call #t~ret17 := main(); {1773#true} is VALID [2020-07-29 01:09:55,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {1773#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1793#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset) (= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2020-07-29 01:09:55,734 INFO L280 TraceCheckUtils]: 6: Hoare triple {1793#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset) (= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {1793#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset) (= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2020-07-29 01:09:55,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {1793#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset) (= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {1793#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset) (= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2020-07-29 01:09:55,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {1793#(and (= (_ bv8 32) (select |#length| main_~list~0.base)) (= (_ bv0 32) main_~list~0.offset) (= (bvadd (select |#valid| main_~list~0.base) (_ bv1 1)) (_ bv0 1)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1803#(and (= (bvadd (select |#length| main_~end~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv0 32) main_~end~0.offset))} is VALID [2020-07-29 01:09:55,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {1803#(and (= (bvadd (select |#length| main_~end~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~end~0.base)) (= (_ bv0 32) main_~end~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {1807#(and (= (bvadd (select |#length| main_~end~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~end~0.offset) (exists ((|main_#t~malloc2.base| (_ BitVec 32))) (and (= (bvadd (select |#length| |main_#t~malloc2.base|) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~end~0.base |main_#t~malloc2.base|)))))} is VALID [2020-07-29 01:09:55,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {1807#(and (= (bvadd (select |#length| main_~end~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~end~0.offset) (exists ((|main_#t~malloc2.base| (_ BitVec 32))) (and (= (bvadd (select |#length| |main_#t~malloc2.base|) (_ bv4294967288 32)) (_ bv0 32)) (not (= main_~end~0.base |main_#t~malloc2.base|)))))} assume !((~bvule32(~bvadd32(4bv32, ~end~0.offset), #length[~end~0.base]) && ~bvule32(~end~0.offset, ~bvadd32(4bv32, ~end~0.offset))) && ~bvule32(0bv32, ~end~0.offset)); {1774#false} is VALID [2020-07-29 01:09:55,740 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:09:55,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:09:55,831 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-29 01:10:00,467 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-07-29 01:10:05,369 WARN L193 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-29 01:10:05,435 INFO L280 TraceCheckUtils]: 10: Hoare triple {1811#(and (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select |#length| main_~end~0.base)) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~end~0.offset), #length[~end~0.base]) && ~bvule32(~end~0.offset, ~bvadd32(4bv32, ~end~0.offset))) && ~bvule32(0bv32, ~end~0.offset)); {1774#false} is VALID [2020-07-29 01:10:05,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {1815#(and (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (or (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select (store |#length| |v_main_#t~malloc2.base_4| (_ bv8 32)) main_~end~0.base)) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1))))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {1811#(and (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select |#length| main_~end~0.base)) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:05,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {1819#(and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select (store |#length| v_prenex_1 (_ bv8 32)) main_~list~0.base)))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32)))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1815#(and (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (or (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select (store |#length| |v_main_#t~malloc2.base_4| (_ bv8 32)) main_~end~0.base)) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1))))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:05,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {1819#(and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select (store |#length| v_prenex_1 (_ bv8 32)) main_~list~0.base)))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32)))))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {1819#(and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select (store |#length| v_prenex_1 (_ bv8 32)) main_~list~0.base)))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:05,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {1819#(and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select (store |#length| v_prenex_1 (_ bv8 32)) main_~list~0.base)))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {1819#(and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select (store |#length| v_prenex_1 (_ bv8 32)) main_~list~0.base)))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:05,461 INFO L280 TraceCheckUtils]: 5: Hoare triple {1773#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1819#(and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_1) (_ bv0 1))) (bvule (bvadd main_~list~0.offset (_ bv4 32)) (select (store |#length| v_prenex_1 (_ bv8 32)) main_~list~0.base)))) (or (forall ((|v_main_#t~malloc2.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_4|) (_ bv0 1)))) (bvule main_~list~0.offset (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:05,461 INFO L263 TraceCheckUtils]: 4: Hoare triple {1773#true} call #t~ret17 := main(); {1773#true} is VALID [2020-07-29 01:10:05,462 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1773#true} {1773#true} #228#return; {1773#true} is VALID [2020-07-29 01:10:05,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {1773#true} assume true; {1773#true} is VALID [2020-07-29 01:10:05,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {1773#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1773#true} is VALID [2020-07-29 01:10:05,463 INFO L263 TraceCheckUtils]: 0: Hoare triple {1773#true} call ULTIMATE.init(); {1773#true} is VALID [2020-07-29 01:10:05,464 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:10:05,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288274768] [2020-07-29 01:10:05,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:05,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-07-29 01:10:05,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733380668] [2020-07-29 01:10:05,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-29 01:10:05,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:05,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:10:05,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:05,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:10:05,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:10:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=36, Unknown=2, NotChecked=0, Total=56 [2020-07-29 01:10:05,517 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 8 states. [2020-07-29 01:10:10,398 WARN L193 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-07-29 01:10:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:21,078 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-07-29 01:10:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:10:21,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-29 01:10:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2020-07-29 01:10:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2020-07-29 01:10:21,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 164 transitions. [2020-07-29 01:10:21,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:21,580 INFO L225 Difference]: With dead ends: 143 [2020-07-29 01:10:21,581 INFO L226 Difference]: Without dead ends: 143 [2020-07-29 01:10:21,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=42, Invalid=66, Unknown=2, NotChecked=0, Total=110 [2020-07-29 01:10:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-29 01:10:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2020-07-29 01:10:21,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:21,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 109 states. [2020-07-29 01:10:21,588 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 109 states. [2020-07-29 01:10:21,588 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 109 states. [2020-07-29 01:10:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:21,593 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-07-29 01:10:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2020-07-29 01:10:21,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:21,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:21,594 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 143 states. [2020-07-29 01:10:21,595 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 143 states. [2020-07-29 01:10:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:21,600 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-07-29 01:10:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2020-07-29 01:10:21,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:21,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:21,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:21,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-07-29 01:10:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2020-07-29 01:10:21,605 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 11 [2020-07-29 01:10:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:21,606 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2020-07-29 01:10:21,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:10:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2020-07-29 01:10:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 01:10:21,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:21,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:21,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:10:21,808 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1247550349, now seen corresponding path program 1 times [2020-07-29 01:10:21,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:21,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536082861] [2020-07-29 01:10:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:21,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:10:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:21,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:21,917 INFO L263 TraceCheckUtils]: 0: Hoare triple {2390#true} call ULTIMATE.init(); {2390#true} is VALID [2020-07-29 01:10:21,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {2390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2390#true} is VALID [2020-07-29 01:10:21,918 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-29 01:10:21,918 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2390#true} {2390#true} #228#return; {2390#true} is VALID [2020-07-29 01:10:21,918 INFO L263 TraceCheckUtils]: 4: Hoare triple {2390#true} call #t~ret17 := main(); {2390#true} is VALID [2020-07-29 01:10:21,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {2390#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,920 INFO L280 TraceCheckUtils]: 6: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2426#(not (= main_~end~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {2426#(not (= main_~end~0.base (_ bv0 32)))} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {2391#false} is VALID [2020-07-29 01:10:21,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {2391#false} assume !false; {2391#false} is VALID [2020-07-29 01:10:21,924 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:10:21,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:21,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {2391#false} assume !false; {2391#false} is VALID [2020-07-29 01:10:21,944 INFO L280 TraceCheckUtils]: 11: Hoare triple {2426#(not (= main_~end~0.base (_ bv0 32)))} assume !(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {2391#false} is VALID [2020-07-29 01:10:21,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2426#(not (= main_~end~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,945 INFO L280 TraceCheckUtils]: 9: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,945 INFO L280 TraceCheckUtils]: 8: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,946 INFO L280 TraceCheckUtils]: 6: Hoare triple {2410#(not (= main_~list~0.base (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,947 INFO L280 TraceCheckUtils]: 5: Hoare triple {2390#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2410#(not (= main_~list~0.base (_ bv0 32)))} is VALID [2020-07-29 01:10:21,947 INFO L263 TraceCheckUtils]: 4: Hoare triple {2390#true} call #t~ret17 := main(); {2390#true} is VALID [2020-07-29 01:10:21,947 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2390#true} {2390#true} #228#return; {2390#true} is VALID [2020-07-29 01:10:21,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-29 01:10:21,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {2390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2390#true} is VALID [2020-07-29 01:10:21,948 INFO L263 TraceCheckUtils]: 0: Hoare triple {2390#true} call ULTIMATE.init(); {2390#true} is VALID [2020-07-29 01:10:21,949 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:10:21,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536082861] [2020-07-29 01:10:21,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:21,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:10:21,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810427470] [2020-07-29 01:10:21,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-29 01:10:21,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:21,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:10:21,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:21,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:10:21,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:10:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:10:21,967 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 4 states. [2020-07-29 01:10:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:22,658 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2020-07-29 01:10:22,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:10:22,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-29 01:10:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2020-07-29 01:10:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:10:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2020-07-29 01:10:22,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2020-07-29 01:10:22,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:22,883 INFO L225 Difference]: With dead ends: 129 [2020-07-29 01:10:22,883 INFO L226 Difference]: Without dead ends: 129 [2020-07-29 01:10:22,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-29 01:10:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2020-07-29 01:10:22,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:22,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 107 states. [2020-07-29 01:10:22,895 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 107 states. [2020-07-29 01:10:22,895 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 107 states. [2020-07-29 01:10:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:22,899 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2020-07-29 01:10:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2020-07-29 01:10:22,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:22,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:22,900 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 129 states. [2020-07-29 01:10:22,900 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 129 states. [2020-07-29 01:10:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:22,905 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2020-07-29 01:10:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2020-07-29 01:10:22,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:22,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:22,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:22,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-29 01:10:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-07-29 01:10:22,909 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 13 [2020-07-29 01:10:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:22,910 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-07-29 01:10:22,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:10:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-07-29 01:10:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:10:22,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:22,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:23,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:10:23,130 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash -18711515, now seen corresponding path program 1 times [2020-07-29 01:10:23,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:23,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772575820] [2020-07-29 01:10:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:23,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:10:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:23,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:23,240 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,248 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:23,248 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:10:23,251 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:23,251 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_93|]. (= |#valid| (store |v_#valid_93| |main_#t~malloc2.base| (_ bv1 1))) [2020-07-29 01:10:23,251 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) [2020-07-29 01:10:23,269 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:23,270 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,275 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:23,276 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,276 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-07-29 01:10:23,284 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:23,285 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_36|, |main_#t~malloc2.base|]. (and (= (store |v_#memory_$Pointer$.base_36| main_~end~0.base (store (select |v_#memory_$Pointer$.base_36| main_~end~0.base) main_~end~0.offset |main_#t~malloc2.base|)) |#memory_$Pointer$.base|) (= (bvadd (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) (_ bv0 1))) [2020-07-29 01:10:23,285 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1)) [2020-07-29 01:10:23,313 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-29 01:10:23,314 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,316 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:23,317 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:23,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-07-29 01:10:23,320 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:23,321 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~end~0.base, main_~end~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (and (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= |main_#t~mem3.base| .cse0))) [2020-07-29 01:10:23,321 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd (select |#valid| |main_#t~mem3.base|) (_ bv1 1)) (_ bv0 1)) [2020-07-29 01:10:23,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2967#true} is VALID [2020-07-29 01:10:23,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {2967#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2967#true} is VALID [2020-07-29 01:10:23,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {2967#true} assume true; {2967#true} is VALID [2020-07-29 01:10:23,349 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2967#true} {2967#true} #228#return; {2967#true} is VALID [2020-07-29 01:10:23,349 INFO L263 TraceCheckUtils]: 4: Hoare triple {2967#true} call #t~ret17 := main(); {2967#true} is VALID [2020-07-29 01:10:23,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {2967#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2967#true} is VALID [2020-07-29 01:10:23,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {2967#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {2967#true} is VALID [2020-07-29 01:10:23,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {2967#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {2967#true} is VALID [2020-07-29 01:10:23,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {2967#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2967#true} is VALID [2020-07-29 01:10:23,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {2967#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {2999#(= (bvadd (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:23,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {2999#(= (bvadd (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {3003#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:23,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {3003#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {3007#(= (bvadd (select |#valid| |main_#t~mem3.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:23,359 INFO L280 TraceCheckUtils]: 12: Hoare triple {3007#(= (bvadd (select |#valid| |main_#t~mem3.base|) (_ bv1 1)) (_ bv0 1))} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {3011#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:10:23,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {3011#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !(1bv1 == #valid[~end~0.base]); {2968#false} is VALID [2020-07-29 01:10:23,360 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:10:23,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:23,395 INFO L280 TraceCheckUtils]: 13: Hoare triple {3011#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !(1bv1 == #valid[~end~0.base]); {2968#false} is VALID [2020-07-29 01:10:23,396 INFO L280 TraceCheckUtils]: 12: Hoare triple {3007#(= (bvadd (select |#valid| |main_#t~mem3.base|) (_ bv1 1)) (_ bv0 1))} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {3011#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:10:23,397 INFO L280 TraceCheckUtils]: 11: Hoare triple {3003#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {3007#(= (bvadd (select |#valid| |main_#t~mem3.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:23,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {2999#(= (bvadd (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {3003#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:23,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {2967#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {2999#(= (bvadd (select |#valid| |main_#t~malloc2.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:23,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {2967#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2967#true} is VALID [2020-07-29 01:10:23,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {2967#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {2967#true} is VALID [2020-07-29 01:10:23,402 INFO L280 TraceCheckUtils]: 6: Hoare triple {2967#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {2967#true} is VALID [2020-07-29 01:10:23,403 INFO L280 TraceCheckUtils]: 5: Hoare triple {2967#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2967#true} is VALID [2020-07-29 01:10:23,403 INFO L263 TraceCheckUtils]: 4: Hoare triple {2967#true} call #t~ret17 := main(); {2967#true} is VALID [2020-07-29 01:10:23,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2967#true} {2967#true} #228#return; {2967#true} is VALID [2020-07-29 01:10:23,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {2967#true} assume true; {2967#true} is VALID [2020-07-29 01:10:23,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {2967#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2967#true} is VALID [2020-07-29 01:10:23,404 INFO L263 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2967#true} is VALID [2020-07-29 01:10:23,405 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:10:23,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772575820] [2020-07-29 01:10:23,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:23,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-29 01:10:23,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487284964] [2020-07-29 01:10:23,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:10:23,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:23,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:23,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:23,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:23,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:23,448 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 6 states. [2020-07-29 01:10:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:25,442 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2020-07-29 01:10:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:10:25,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:10:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2020-07-29 01:10:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2020-07-29 01:10:25,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2020-07-29 01:10:25,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:25,751 INFO L225 Difference]: With dead ends: 160 [2020-07-29 01:10:25,751 INFO L226 Difference]: Without dead ends: 160 [2020-07-29 01:10:25,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:10:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-29 01:10:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2020-07-29 01:10:25,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:25,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 106 states. [2020-07-29 01:10:25,756 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 106 states. [2020-07-29 01:10:25,757 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 106 states. [2020-07-29 01:10:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:25,762 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2020-07-29 01:10:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2020-07-29 01:10:25,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:25,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:25,763 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 160 states. [2020-07-29 01:10:25,763 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 160 states. [2020-07-29 01:10:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:25,769 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2020-07-29 01:10:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2020-07-29 01:10:25,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:25,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:25,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:25,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 01:10:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2020-07-29 01:10:25,775 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 14 [2020-07-29 01:10:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:25,775 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2020-07-29 01:10:25,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2020-07-29 01:10:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:10:25,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:25,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:25,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-29 01:10:25,999 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash -18711514, now seen corresponding path program 1 times [2020-07-29 01:10:26,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:26,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532330095] [2020-07-29 01:10:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:26,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:10:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:26,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:26,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:26,136 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,142 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,143 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,143 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:10:26,148 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:26,149 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_62|]. (and (= |main_#t~malloc2.offset| (_ bv0 32)) (= (store |v_#length_62| |main_#t~malloc2.base| (_ bv8 32)) |#length|)) [2020-07-29 01:10:26,149 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| |main_#t~malloc2.base|) (_ bv8 32)) (= |main_#t~malloc2.offset| (_ bv0 32))) [2020-07-29 01:10:26,183 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:26,184 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,195 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,200 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:26,201 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,215 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,217 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,217 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-07-29 01:10:26,261 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:26,261 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_38|, |main_#t~malloc2.base|, |v_#memory_$Pointer$.offset_37|]. (and (= (bvadd (select |#length| |main_#t~malloc2.base|) (_ bv4294967288 32)) (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_37| main_~end~0.base (store (select |v_#memory_$Pointer$.offset_37| main_~end~0.base) main_~end~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.base_38| main_~end~0.base (store (select |v_#memory_$Pointer$.base_38| main_~end~0.base) main_~end~0.offset |main_#t~malloc2.base|)) |#memory_$Pointer$.base|)) [2020-07-29 01:10:26,261 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv4294967288 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv0 32))) [2020-07-29 01:10:26,300 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-29 01:10:26,300 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,308 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:10:26,313 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,319 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:26,320 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:26,320 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2020-07-29 01:10:26,326 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:26,326 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, main_~end~0.base, main_~end~0.offset, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (.cse1 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (and (= .cse0 |main_#t~mem3.offset|) (= (bvadd (select |#length| .cse1) (_ bv4294967288 32)) (_ bv0 32)) (= .cse0 (_ bv0 32)) (= |main_#t~mem3.base| .cse1))) [2020-07-29 01:10:26,326 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) (bvadd (select |#length| |main_#t~mem3.base|) (_ bv4294967288 32))) (= |main_#t~mem3.offset| (_ bv0 32))) [2020-07-29 01:10:26,369 INFO L263 TraceCheckUtils]: 0: Hoare triple {3648#true} call ULTIMATE.init(); {3648#true} is VALID [2020-07-29 01:10:26,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {3648#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3648#true} is VALID [2020-07-29 01:10:26,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {3648#true} assume true; {3648#true} is VALID [2020-07-29 01:10:26,370 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3648#true} {3648#true} #228#return; {3648#true} is VALID [2020-07-29 01:10:26,370 INFO L263 TraceCheckUtils]: 4: Hoare triple {3648#true} call #t~ret17 := main(); {3648#true} is VALID [2020-07-29 01:10:26,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {3648#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {3648#true} is VALID [2020-07-29 01:10:26,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {3648#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {3648#true} is VALID [2020-07-29 01:10:26,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {3648#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {3648#true} is VALID [2020-07-29 01:10:26,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {3648#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3648#true} is VALID [2020-07-29 01:10:26,374 INFO L280 TraceCheckUtils]: 9: Hoare triple {3648#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {3680#(and (= |main_#t~malloc2.offset| (_ bv0 32)) (= (bvadd (select |#length| |main_#t~malloc2.base|) (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2020-07-29 01:10:26,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {3680#(and (= |main_#t~malloc2.offset| (_ bv0 32)) (= (bvadd (select |#length| |main_#t~malloc2.base|) (_ bv4294967288 32)) (_ bv0 32)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {3684#(and (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv4294967288 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv0 32)))} is VALID [2020-07-29 01:10:26,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {3684#(and (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv4294967288 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv0 32)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {3688#(and (= (_ bv8 32) (select |#length| |main_#t~mem3.base|)) (= |main_#t~mem3.offset| (_ bv0 32)))} is VALID [2020-07-29 01:10:26,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {3688#(and (= (_ bv8 32) (select |#length| |main_#t~mem3.base|)) (= |main_#t~mem3.offset| (_ bv0 32)))} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {3692#(and (= (bvadd (select |#length| main_~end~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~end~0.offset))} is VALID [2020-07-29 01:10:26,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {3692#(and (= (bvadd (select |#length| main_~end~0.base) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv0 32) main_~end~0.offset))} assume !((~bvule32(~bvadd32(4bv32, ~end~0.offset), #length[~end~0.base]) && ~bvule32(~end~0.offset, ~bvadd32(4bv32, ~end~0.offset))) && ~bvule32(0bv32, ~end~0.offset)); {3649#false} is VALID [2020-07-29 01:10:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:10:26,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:26,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {3696#(and (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select |#length| main_~end~0.base)) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~end~0.offset), #length[~end~0.base]) && ~bvule32(~end~0.offset, ~bvadd32(4bv32, ~end~0.offset))) && ~bvule32(0bv32, ~end~0.offset)); {3649#false} is VALID [2020-07-29 01:10:26,822 INFO L280 TraceCheckUtils]: 12: Hoare triple {3700#(and (bvule |main_#t~mem3.offset| (bvadd |main_#t~mem3.offset| (_ bv4 32))) (bvule (bvadd |main_#t~mem3.offset| (_ bv4 32)) (select |#length| |main_#t~mem3.base|)))} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {3696#(and (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select |#length| main_~end~0.base)) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:26,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {3704#(and (bvule (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {3700#(and (bvule |main_#t~mem3.offset| (bvadd |main_#t~mem3.offset| (_ bv4 32))) (bvule (bvadd |main_#t~mem3.offset| (_ bv4 32)) (select |#length| |main_#t~mem3.base|)))} is VALID [2020-07-29 01:10:26,853 INFO L280 TraceCheckUtils]: 10: Hoare triple {3708#(and (bvule |main_#t~malloc2.offset| (bvadd |main_#t~malloc2.offset| (_ bv4 32))) (bvule (bvadd |main_#t~malloc2.offset| (_ bv4 32)) (select |#length| |main_#t~malloc2.base|)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {3704#(and (bvule (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))} is VALID [2020-07-29 01:10:26,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {3648#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {3708#(and (bvule |main_#t~malloc2.offset| (bvadd |main_#t~malloc2.offset| (_ bv4 32))) (bvule (bvadd |main_#t~malloc2.offset| (_ bv4 32)) (select |#length| |main_#t~malloc2.base|)))} is VALID [2020-07-29 01:10:26,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {3648#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3648#true} is VALID [2020-07-29 01:10:26,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {3648#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {3648#true} is VALID [2020-07-29 01:10:26,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {3648#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {3648#true} is VALID [2020-07-29 01:10:26,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {3648#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {3648#true} is VALID [2020-07-29 01:10:26,856 INFO L263 TraceCheckUtils]: 4: Hoare triple {3648#true} call #t~ret17 := main(); {3648#true} is VALID [2020-07-29 01:10:26,857 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3648#true} {3648#true} #228#return; {3648#true} is VALID [2020-07-29 01:10:26,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {3648#true} assume true; {3648#true} is VALID [2020-07-29 01:10:26,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {3648#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3648#true} is VALID [2020-07-29 01:10:26,857 INFO L263 TraceCheckUtils]: 0: Hoare triple {3648#true} call ULTIMATE.init(); {3648#true} is VALID [2020-07-29 01:10:26,858 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:10:26,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532330095] [2020-07-29 01:10:26,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:26,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-07-29 01:10:26,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686626713] [2020-07-29 01:10:26,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-07-29 01:10:26,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:26,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:10:26,924 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:10:26,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:10:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:10:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:26,925 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 10 states. [2020-07-29 01:10:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:33,916 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2020-07-29 01:10:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:10:33,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-07-29 01:10:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:10:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2020-07-29 01:10:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:10:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2020-07-29 01:10:33,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 199 transitions. [2020-07-29 01:10:34,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:34,350 INFO L225 Difference]: With dead ends: 214 [2020-07-29 01:10:34,351 INFO L226 Difference]: Without dead ends: 214 [2020-07-29 01:10:34,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:10:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-29 01:10:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 103. [2020-07-29 01:10:34,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:34,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 103 states. [2020-07-29 01:10:34,356 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 103 states. [2020-07-29 01:10:34,356 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 103 states. [2020-07-29 01:10:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,363 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2020-07-29 01:10:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2020-07-29 01:10:34,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:34,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:34,365 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 214 states. [2020-07-29 01:10:34,365 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 214 states. [2020-07-29 01:10:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:34,372 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2020-07-29 01:10:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2020-07-29 01:10:34,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:34,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:34,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:34,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-29 01:10:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2020-07-29 01:10:34,377 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 14 [2020-07-29 01:10:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:34,378 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2020-07-29 01:10:34,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:10:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2020-07-29 01:10:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:10:34,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:34,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:34,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-07-29 01:10:34,591 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1416431696, now seen corresponding path program 1 times [2020-07-29 01:10:34,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:34,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107382802] [2020-07-29 01:10:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:34,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:10:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:34,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:34,705 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:34,705 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:34,710 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:34,710 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:34,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-07-29 01:10:34,753 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-29 01:10:34,753 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:34,756 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:34,756 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:34,756 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-07-29 01:10:34,762 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:34,762 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, main_~end~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= |main_#t~mem7| .cse0) (= ~unnamed1~0~BLACK .cse0))) [2020-07-29 01:10:34,762 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ~unnamed1~0~BLACK |main_#t~mem7|) [2020-07-29 01:10:34,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4498#true} is VALID [2020-07-29 01:10:34,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {4498#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4498#true} is VALID [2020-07-29 01:10:34,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2020-07-29 01:10:34,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #228#return; {4498#true} is VALID [2020-07-29 01:10:34,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {4498#true} call #t~ret17 := main(); {4498#true} is VALID [2020-07-29 01:10:34,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {4498#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4498#true} is VALID [2020-07-29 01:10:34,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {4498#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {4498#true} is VALID [2020-07-29 01:10:34,777 INFO L280 TraceCheckUtils]: 7: Hoare triple {4498#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:34,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:34,778 INFO L280 TraceCheckUtils]: 9: Hoare triple {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:34,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:34,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:34,780 INFO L280 TraceCheckUtils]: 12: Hoare triple {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} goto; {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:34,783 INFO L280 TraceCheckUtils]: 13: Hoare triple {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} SUMMARY for call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1028-4 {4544#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-29 01:10:34,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {4544#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {4499#false} is VALID [2020-07-29 01:10:34,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2020-07-29 01:10:34,785 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:10:34,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:36,851 INFO L280 TraceCheckUtils]: 15: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2020-07-29 01:10:36,857 INFO L280 TraceCheckUtils]: 14: Hoare triple {4544#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {4499#false} is VALID [2020-07-29 01:10:36,860 INFO L280 TraceCheckUtils]: 13: Hoare triple {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} SUMMARY for call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1028-4 {4544#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-29 01:10:36,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} goto; {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:36,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:36,862 INFO L280 TraceCheckUtils]: 10: Hoare triple {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4534#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:36,862 INFO L280 TraceCheckUtils]: 9: Hoare triple {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:36,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:36,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {4498#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {4524#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:36,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {4498#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {4498#true} is VALID [2020-07-29 01:10:36,867 INFO L280 TraceCheckUtils]: 5: Hoare triple {4498#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4498#true} is VALID [2020-07-29 01:10:36,867 INFO L263 TraceCheckUtils]: 4: Hoare triple {4498#true} call #t~ret17 := main(); {4498#true} is VALID [2020-07-29 01:10:36,867 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #228#return; {4498#true} is VALID [2020-07-29 01:10:36,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2020-07-29 01:10:36,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {4498#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4498#true} is VALID [2020-07-29 01:10:36,868 INFO L263 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4498#true} is VALID [2020-07-29 01:10:36,868 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:10:36,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107382802] [2020-07-29 01:10:36,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:36,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-29 01:10:36,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866686507] [2020-07-29 01:10:36,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:10:36,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:36,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:10:36,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:36,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:10:36,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:10:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:10:36,898 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 5 states. [2020-07-29 01:10:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:38,215 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2020-07-29 01:10:38,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:10:38,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:10:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2020-07-29 01:10:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:10:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2020-07-29 01:10:38,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 159 transitions. [2020-07-29 01:10:38,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:38,480 INFO L225 Difference]: With dead ends: 164 [2020-07-29 01:10:38,480 INFO L226 Difference]: Without dead ends: 164 [2020-07-29 01:10:38,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:10:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-07-29 01:10:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2020-07-29 01:10:38,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:38,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 109 states. [2020-07-29 01:10:38,484 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 109 states. [2020-07-29 01:10:38,485 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 109 states. [2020-07-29 01:10:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:38,490 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2020-07-29 01:10:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2020-07-29 01:10:38,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:38,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:38,491 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 164 states. [2020-07-29 01:10:38,491 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 164 states. [2020-07-29 01:10:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:38,497 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2020-07-29 01:10:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2020-07-29 01:10:38,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:38,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:38,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:38,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-07-29 01:10:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2020-07-29 01:10:38,502 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 16 [2020-07-29 01:10:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:38,502 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2020-07-29 01:10:38,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:10:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-07-29 01:10:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:10:38,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:38,503 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:10:38,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-07-29 01:10:38,708 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash -257752642, now seen corresponding path program 1 times [2020-07-29 01:10:38,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:38,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535736840] [2020-07-29 01:10:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:38,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:10:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:38,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:38,873 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:38,873 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:38,876 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:38,877 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:38,877 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:10:38,881 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:38,881 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_105|]. (= |#valid| (store |v_#valid_105| |main_#t~malloc5.base| (_ bv1 1))) [2020-07-29 01:10:38,881 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_#t~malloc5.base|) (_ bv1 1)) [2020-07-29 01:10:38,901 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:38,901 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:38,910 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:38,911 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:38,911 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-07-29 01:10:38,921 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:38,921 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_41|, |main_#t~malloc5.base|]. (and (= (store |v_#memory_$Pointer$.base_41| main_~end~0.base (store (select |v_#memory_$Pointer$.base_41| main_~end~0.base) main_~end~0.offset |main_#t~malloc5.base|)) |#memory_$Pointer$.base|) (= (bvadd (select |#valid| |main_#t~malloc5.base|) (_ bv1 1)) (_ bv0 1))) [2020-07-29 01:10:38,922 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1)) [2020-07-29 01:10:38,944 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-29 01:10:38,945 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:38,948 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:38,949 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:38,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-07-29 01:10:38,953 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:38,954 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~end~0.base, main_~end~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (and (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= |main_#t~mem6.base| .cse0))) [2020-07-29 01:10:38,954 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd (select |#valid| |main_#t~mem6.base|) (_ bv1 1)) (_ bv0 1)) [2020-07-29 01:10:38,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {5203#true} call ULTIMATE.init(); {5203#true} is VALID [2020-07-29 01:10:38,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {5203#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5203#true} is VALID [2020-07-29 01:10:38,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {5203#true} assume true; {5203#true} is VALID [2020-07-29 01:10:38,976 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5203#true} {5203#true} #228#return; {5203#true} is VALID [2020-07-29 01:10:38,977 INFO L263 TraceCheckUtils]: 4: Hoare triple {5203#true} call #t~ret17 := main(); {5203#true} is VALID [2020-07-29 01:10:38,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {5203#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5203#true} is VALID [2020-07-29 01:10:38,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {5203#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {5203#true} is VALID [2020-07-29 01:10:38,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {5203#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {5203#true} is VALID [2020-07-29 01:10:38,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {5203#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5203#true} is VALID [2020-07-29 01:10:38,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {5203#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {5203#true} is VALID [2020-07-29 01:10:38,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {5203#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {5203#true} is VALID [2020-07-29 01:10:38,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {5203#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {5203#true} is VALID [2020-07-29 01:10:38,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {5203#true} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {5203#true} is VALID [2020-07-29 01:10:38,979 INFO L280 TraceCheckUtils]: 13: Hoare triple {5203#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1007 {5203#true} is VALID [2020-07-29 01:10:38,979 INFO L280 TraceCheckUtils]: 14: Hoare triple {5203#true} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {5203#true} is VALID [2020-07-29 01:10:38,979 INFO L280 TraceCheckUtils]: 15: Hoare triple {5203#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1015 {5203#true} is VALID [2020-07-29 01:10:38,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {5203#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8bv32); {5256#(= (bvadd (select |#valid| |main_#t~malloc5.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:38,984 INFO L280 TraceCheckUtils]: 17: Hoare triple {5256#(= (bvadd (select |#valid| |main_#t~malloc5.base|) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016 {5260#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:38,986 INFO L280 TraceCheckUtils]: 18: Hoare triple {5260#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016-1 {5264#(= (bvadd (select |#valid| |main_#t~mem6.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:38,987 INFO L280 TraceCheckUtils]: 19: Hoare triple {5264#(= (bvadd (select |#valid| |main_#t~mem6.base|) (_ bv1 1)) (_ bv0 1))} ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {5268#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:10:38,987 INFO L280 TraceCheckUtils]: 20: Hoare triple {5268#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !(1bv1 == #valid[~end~0.base]); {5204#false} is VALID [2020-07-29 01:10:38,988 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:10:38,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:39,033 INFO L280 TraceCheckUtils]: 20: Hoare triple {5268#(= (_ bv1 1) (select |#valid| main_~end~0.base))} assume !(1bv1 == #valid[~end~0.base]); {5204#false} is VALID [2020-07-29 01:10:39,034 INFO L280 TraceCheckUtils]: 19: Hoare triple {5264#(= (bvadd (select |#valid| |main_#t~mem6.base|) (_ bv1 1)) (_ bv0 1))} ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {5268#(= (_ bv1 1) (select |#valid| main_~end~0.base))} is VALID [2020-07-29 01:10:39,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {5260#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016-1 {5264#(= (bvadd (select |#valid| |main_#t~mem6.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:39,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {5256#(= (bvadd (select |#valid| |main_#t~malloc5.base|) (_ bv1 1)) (_ bv0 1))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016 {5260#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:39,040 INFO L280 TraceCheckUtils]: 16: Hoare triple {5203#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8bv32); {5256#(= (bvadd (select |#valid| |main_#t~malloc5.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:10:39,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {5203#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1015 {5203#true} is VALID [2020-07-29 01:10:39,040 INFO L280 TraceCheckUtils]: 14: Hoare triple {5203#true} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {5203#true} is VALID [2020-07-29 01:10:39,040 INFO L280 TraceCheckUtils]: 13: Hoare triple {5203#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1007 {5203#true} is VALID [2020-07-29 01:10:39,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {5203#true} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {5203#true} is VALID [2020-07-29 01:10:39,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {5203#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {5203#true} is VALID [2020-07-29 01:10:39,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {5203#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {5203#true} is VALID [2020-07-29 01:10:39,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {5203#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {5203#true} is VALID [2020-07-29 01:10:39,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {5203#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5203#true} is VALID [2020-07-29 01:10:39,041 INFO L280 TraceCheckUtils]: 7: Hoare triple {5203#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {5203#true} is VALID [2020-07-29 01:10:39,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {5203#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {5203#true} is VALID [2020-07-29 01:10:39,042 INFO L280 TraceCheckUtils]: 5: Hoare triple {5203#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5203#true} is VALID [2020-07-29 01:10:39,042 INFO L263 TraceCheckUtils]: 4: Hoare triple {5203#true} call #t~ret17 := main(); {5203#true} is VALID [2020-07-29 01:10:39,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5203#true} {5203#true} #228#return; {5203#true} is VALID [2020-07-29 01:10:39,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {5203#true} assume true; {5203#true} is VALID [2020-07-29 01:10:39,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {5203#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5203#true} is VALID [2020-07-29 01:10:39,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {5203#true} call ULTIMATE.init(); {5203#true} is VALID [2020-07-29 01:10:39,044 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:10:39,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535736840] [2020-07-29 01:10:39,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:39,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-29 01:10:39,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210155029] [2020-07-29 01:10:39,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:10:39,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:39,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:10:39,073 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:10:39,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:10:39,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:10:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:10:39,074 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2020-07-29 01:10:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:41,208 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2020-07-29 01:10:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:10:41,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:10:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2020-07-29 01:10:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:10:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2020-07-29 01:10:41,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 163 transitions. [2020-07-29 01:10:41,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:41,500 INFO L225 Difference]: With dead ends: 170 [2020-07-29 01:10:41,500 INFO L226 Difference]: Without dead ends: 170 [2020-07-29 01:10:41,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:10:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-07-29 01:10:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 108. [2020-07-29 01:10:41,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:41,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 108 states. [2020-07-29 01:10:41,505 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 108 states. [2020-07-29 01:10:41,505 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 108 states. [2020-07-29 01:10:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:41,510 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2020-07-29 01:10:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2020-07-29 01:10:41,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:41,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:41,511 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 170 states. [2020-07-29 01:10:41,511 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 170 states. [2020-07-29 01:10:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:41,515 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2020-07-29 01:10:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2020-07-29 01:10:41,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:41,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:41,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:41,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-29 01:10:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-07-29 01:10:41,520 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 21 [2020-07-29 01:10:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:41,520 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-07-29 01:10:41,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:10:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-07-29 01:10:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:10:41,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:41,522 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:10:41,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-07-29 01:10:41,735 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash -257752641, now seen corresponding path program 1 times [2020-07-29 01:10:41,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:41,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562389211] [2020-07-29 01:10:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:41,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:10:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:41,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:41,921 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:10:41,921 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:41,929 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:41,929 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:41,929 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-29 01:10:41,935 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:41,936 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_65|]. (and (= |#length| (store |v_#length_65| |main_#t~malloc5.base| (_ bv8 32))) (= |main_#t~malloc5.offset| (_ bv0 32))) [2020-07-29 01:10:41,936 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| |main_#t~malloc5.base|) (_ bv8 32)) (= |main_#t~malloc5.offset| (_ bv0 32))) [2020-07-29 01:10:41,967 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:41,968 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:41,985 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:41,988 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:10:41,989 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:42,003 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:42,004 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:42,004 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-07-29 01:10:42,068 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:42,069 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_43|, |main_#t~malloc5.base|, |v_#memory_$Pointer$.offset_41|]. (and (= (bvadd (select |#length| |main_#t~malloc5.base|) (_ bv4294967288 32)) (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_41| main_~end~0.base (store (select |v_#memory_$Pointer$.offset_41| main_~end~0.base) main_~end~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.base_43| main_~end~0.base (store (select |v_#memory_$Pointer$.base_43| main_~end~0.base) main_~end~0.offset |main_#t~malloc5.base|)) |#memory_$Pointer$.base|)) [2020-07-29 01:10:42,069 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv4294967288 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv0 32))) [2020-07-29 01:10:42,113 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-29 01:10:42,114 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:42,123 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:42,128 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:10:42,129 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:42,137 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:42,137 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:42,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2020-07-29 01:10:42,142 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:42,143 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, main_~end~0.base, main_~end~0.offset, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (.cse1 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (and (= .cse0 |main_#t~mem6.offset|) (= (bvadd (select |#length| .cse1) (_ bv4294967288 32)) (_ bv0 32)) (= .cse0 (_ bv0 32)) (= |main_#t~mem6.base| .cse1))) [2020-07-29 01:10:42,143 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd (select |#length| |main_#t~mem6.base|) (_ bv4294967288 32)) (_ bv0 32)) (= |main_#t~mem6.offset| (_ bv0 32))) [2020-07-29 01:10:42,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {5959#true} call ULTIMATE.init(); {5959#true} is VALID [2020-07-29 01:10:42,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {5959#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5959#true} is VALID [2020-07-29 01:10:42,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {5959#true} assume true; {5959#true} is VALID [2020-07-29 01:10:42,185 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5959#true} {5959#true} #228#return; {5959#true} is VALID [2020-07-29 01:10:42,185 INFO L263 TraceCheckUtils]: 4: Hoare triple {5959#true} call #t~ret17 := main(); {5959#true} is VALID [2020-07-29 01:10:42,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {5959#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5959#true} is VALID [2020-07-29 01:10:42,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {5959#true} is VALID [2020-07-29 01:10:42,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {5959#true} is VALID [2020-07-29 01:10:42,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {5959#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5959#true} is VALID [2020-07-29 01:10:42,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {5959#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {5959#true} is VALID [2020-07-29 01:10:42,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {5959#true} is VALID [2020-07-29 01:10:42,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {5959#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {5959#true} is VALID [2020-07-29 01:10:42,186 INFO L280 TraceCheckUtils]: 12: Hoare triple {5959#true} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {5959#true} is VALID [2020-07-29 01:10:42,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1007 {5959#true} is VALID [2020-07-29 01:10:42,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {5959#true} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {5959#true} is VALID [2020-07-29 01:10:42,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1015 {5959#true} is VALID [2020-07-29 01:10:42,191 INFO L280 TraceCheckUtils]: 16: Hoare triple {5959#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8bv32); {6012#(and (= (bvadd (select |#length| |main_#t~malloc5.base|) (_ bv4294967288 32)) (_ bv0 32)) (= |main_#t~malloc5.offset| (_ bv0 32)))} is VALID [2020-07-29 01:10:42,194 INFO L280 TraceCheckUtils]: 17: Hoare triple {6012#(and (= (bvadd (select |#length| |main_#t~malloc5.base|) (_ bv4294967288 32)) (_ bv0 32)) (= |main_#t~malloc5.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016 {6016#(and (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv4294967288 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv0 32)))} is VALID [2020-07-29 01:10:42,195 INFO L280 TraceCheckUtils]: 18: Hoare triple {6016#(and (= (bvadd (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (_ bv4294967288 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv0 32)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016-1 {6020#(and (= (bvadd (select |#length| |main_#t~mem6.base|) (_ bv4294967288 32)) (_ bv0 32)) (= |main_#t~mem6.offset| (_ bv0 32)))} is VALID [2020-07-29 01:10:42,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {6020#(and (= (bvadd (select |#length| |main_#t~mem6.base|) (_ bv4294967288 32)) (_ bv0 32)) (= |main_#t~mem6.offset| (_ bv0 32)))} ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {6024#(and (= (_ bv8 32) (select |#length| main_~end~0.base)) (= (_ bv0 32) main_~end~0.offset))} is VALID [2020-07-29 01:10:42,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {6024#(and (= (_ bv8 32) (select |#length| main_~end~0.base)) (= (_ bv0 32) main_~end~0.offset))} assume !((~bvule32(~bvadd32(4bv32, ~end~0.offset), #length[~end~0.base]) && ~bvule32(~end~0.offset, ~bvadd32(4bv32, ~end~0.offset))) && ~bvule32(0bv32, ~end~0.offset)); {5960#false} is VALID [2020-07-29 01:10:42,196 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:10:42,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:42,663 INFO L280 TraceCheckUtils]: 20: Hoare triple {6028#(and (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select |#length| main_~end~0.base)) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~end~0.offset), #length[~end~0.base]) && ~bvule32(~end~0.offset, ~bvadd32(4bv32, ~end~0.offset))) && ~bvule32(0bv32, ~end~0.offset)); {5960#false} is VALID [2020-07-29 01:10:42,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {6032#(and (bvule (bvadd |main_#t~mem6.offset| (_ bv4 32)) (select |#length| |main_#t~mem6.base|)) (bvule |main_#t~mem6.offset| (bvadd |main_#t~mem6.offset| (_ bv4 32))))} ~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {6028#(and (bvule (bvadd main_~end~0.offset (_ bv4 32)) (select |#length| main_~end~0.base)) (bvule main_~end~0.offset (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:42,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {6036#(and (bvule (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016-1 {6032#(and (bvule (bvadd |main_#t~mem6.offset| (_ bv4 32)) (select |#length| |main_#t~mem6.base|)) (bvule |main_#t~mem6.offset| (bvadd |main_#t~mem6.offset| (_ bv4 32))))} is VALID [2020-07-29 01:10:42,730 INFO L280 TraceCheckUtils]: 17: Hoare triple {6040#(and (bvule |main_#t~malloc5.offset| (bvadd |main_#t~malloc5.offset| (_ bv4 32))) (bvule (bvadd |main_#t~malloc5.offset| (_ bv4 32)) (select |#length| |main_#t~malloc5.base|)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1016 {6036#(and (bvule (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))} is VALID [2020-07-29 01:10:42,734 INFO L280 TraceCheckUtils]: 16: Hoare triple {5959#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8bv32); {6040#(and (bvule |main_#t~malloc5.offset| (bvadd |main_#t~malloc5.offset| (_ bv4 32))) (bvule (bvadd |main_#t~malloc5.offset| (_ bv4 32)) (select |#length| |main_#t~malloc5.base|)))} is VALID [2020-07-29 01:10:42,734 INFO L280 TraceCheckUtils]: 15: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1015 {5959#true} is VALID [2020-07-29 01:10:42,734 INFO L280 TraceCheckUtils]: 14: Hoare triple {5959#true} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {5959#true} is VALID [2020-07-29 01:10:42,735 INFO L280 TraceCheckUtils]: 13: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1007 {5959#true} is VALID [2020-07-29 01:10:42,735 INFO L280 TraceCheckUtils]: 12: Hoare triple {5959#true} ~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {5959#true} is VALID [2020-07-29 01:10:42,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {5959#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005-1 {5959#true} is VALID [2020-07-29 01:10:42,735 INFO L280 TraceCheckUtils]: 10: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4bv32); srcloc: L1005 {5959#true} is VALID [2020-07-29 01:10:42,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {5959#true} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8bv32); {5959#true} is VALID [2020-07-29 01:10:42,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {5959#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5959#true} is VALID [2020-07-29 01:10:42,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {5959#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {5959#true} is VALID [2020-07-29 01:10:42,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {5959#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {5959#true} is VALID [2020-07-29 01:10:42,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {5959#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5959#true} is VALID [2020-07-29 01:10:42,736 INFO L263 TraceCheckUtils]: 4: Hoare triple {5959#true} call #t~ret17 := main(); {5959#true} is VALID [2020-07-29 01:10:42,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5959#true} {5959#true} #228#return; {5959#true} is VALID [2020-07-29 01:10:42,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {5959#true} assume true; {5959#true} is VALID [2020-07-29 01:10:42,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {5959#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5959#true} is VALID [2020-07-29 01:10:42,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {5959#true} call ULTIMATE.init(); {5959#true} is VALID [2020-07-29 01:10:42,739 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:10:42,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562389211] [2020-07-29 01:10:42,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:42,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-07-29 01:10:42,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939089645] [2020-07-29 01:10:42,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-29 01:10:42,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:42,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:10:42,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:42,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:10:42,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:42,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:10:42,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:42,811 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 10 states. [2020-07-29 01:10:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:50,674 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2020-07-29 01:10:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:10:50,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-29 01:10:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:10:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2020-07-29 01:10:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:10:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2020-07-29 01:10:50,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 207 transitions. [2020-07-29 01:10:51,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:51,100 INFO L225 Difference]: With dead ends: 225 [2020-07-29 01:10:51,100 INFO L226 Difference]: Without dead ends: 225 [2020-07-29 01:10:51,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:10:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-07-29 01:10:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 106. [2020-07-29 01:10:51,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:51,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 106 states. [2020-07-29 01:10:51,108 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 106 states. [2020-07-29 01:10:51,109 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 106 states. [2020-07-29 01:10:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:51,115 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2020-07-29 01:10:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 245 transitions. [2020-07-29 01:10:51,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:51,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:51,116 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 225 states. [2020-07-29 01:10:51,116 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 225 states. [2020-07-29 01:10:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:51,122 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2020-07-29 01:10:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 245 transitions. [2020-07-29 01:10:51,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:51,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:51,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:51,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 01:10:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2020-07-29 01:10:51,127 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2020-07-29 01:10:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:51,127 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2020-07-29 01:10:51,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:10:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2020-07-29 01:10:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:10:51,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:51,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:51,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-07-29 01:10:51,343 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1483402633, now seen corresponding path program 1 times [2020-07-29 01:10:51,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:51,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811071335] [2020-07-29 01:10:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:51,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:10:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:10:51,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:10:51,473 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-29 01:10:51,473 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,477 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:51,478 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-07-29 01:10:51,530 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-07-29 01:10:51,530 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,534 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:10:51,535 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:10:51,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-07-29 01:10:51,539 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:10:51,540 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~end~0.base, main_~end~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))) (and (= ~unnamed1~0~BLACK .cse0) (= |main_#t~mem8| .cse0))) [2020-07-29 01:10:51,540 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ~unnamed1~0~BLACK |main_#t~mem8|) [2020-07-29 01:10:51,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6885#true} is VALID [2020-07-29 01:10:51,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {6885#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6885#true} is VALID [2020-07-29 01:10:51,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2020-07-29 01:10:51,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #228#return; {6885#true} is VALID [2020-07-29 01:10:51,557 INFO L263 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret17 := main(); {6885#true} is VALID [2020-07-29 01:10:51,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {6885#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6885#true} is VALID [2020-07-29 01:10:51,557 INFO L280 TraceCheckUtils]: 6: Hoare triple {6885#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {6885#true} is VALID [2020-07-29 01:10:51,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {6885#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {6911#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {6911#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6911#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,562 INFO L280 TraceCheckUtils]: 9: Hoare triple {6911#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {6911#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {6911#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} goto; {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} SUMMARY for call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1028-4 {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} goto; {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} is VALID [2020-07-29 01:10:51,568 INFO L280 TraceCheckUtils]: 17: Hoare triple {6921#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32))))} SUMMARY for call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1032 {6943#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-29 01:10:51,569 INFO L280 TraceCheckUtils]: 18: Hoare triple {6943#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8; {6886#false} is VALID [2020-07-29 01:10:51,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {6886#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1034 {6886#false} is VALID [2020-07-29 01:10:51,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {6886#false} ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6886#false} is VALID [2020-07-29 01:10:51,570 INFO L280 TraceCheckUtils]: 21: Hoare triple {6886#false} assume !(1bv1 == #valid[~end~0.base]); {6886#false} is VALID [2020-07-29 01:10:51,571 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:10:51,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:10:53,737 INFO L280 TraceCheckUtils]: 21: Hoare triple {6886#false} assume !(1bv1 == #valid[~end~0.base]); {6886#false} is VALID [2020-07-29 01:10:53,737 INFO L280 TraceCheckUtils]: 20: Hoare triple {6886#false} ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6886#false} is VALID [2020-07-29 01:10:53,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {6886#false} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); srcloc: L1034 {6886#false} is VALID [2020-07-29 01:10:53,738 INFO L280 TraceCheckUtils]: 18: Hoare triple {6965#(not (= ~unnamed1~0~RED |main_#t~mem8|))} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8; {6886#false} is VALID [2020-07-29 01:10:53,739 INFO L280 TraceCheckUtils]: 17: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} SUMMARY for call #t~mem8 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1032 {6965#(not (= ~unnamed1~0~RED |main_#t~mem8|))} is VALID [2020-07-29 01:10:53,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} goto; {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,741 INFO L280 TraceCheckUtils]: 14: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,741 INFO L280 TraceCheckUtils]: 13: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} SUMMARY for call #t~mem7 := read~intINTTYPE4(~end~0.base, ~bvadd32(4bv32, ~end~0.offset), 4bv32); srcloc: L1028-4 {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,742 INFO L280 TraceCheckUtils]: 12: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} goto; {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} assume !!(0bv32 != ~end~0.base || 0bv32 != ~end~0.offset); {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {6991#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} ~end~0.base, ~end~0.offset := 0bv32, 0bv32;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6969#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {6991#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {6991#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,744 INFO L280 TraceCheckUtils]: 8: Hoare triple {6991#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6991#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {6885#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32); srcloc: L996-1 {6991#(not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))))} is VALID [2020-07-29 01:10:53,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {6885#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~list~0.base, ~list~0.offset, 4bv32); srcloc: L996 {6885#true} is VALID [2020-07-29 01:10:53,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {6885#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8bv32);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6885#true} is VALID [2020-07-29 01:10:53,750 INFO L263 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret17 := main(); {6885#true} is VALID [2020-07-29 01:10:53,750 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #228#return; {6885#true} is VALID [2020-07-29 01:10:53,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2020-07-29 01:10:53,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {6885#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6885#true} is VALID [2020-07-29 01:10:53,750 INFO L263 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6885#true} is VALID [2020-07-29 01:10:53,751 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:10:53,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811071335] [2020-07-29 01:10:53,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:10:53,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-29 01:10:53,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954920393] [2020-07-29 01:10:53,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-29 01:10:53,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:10:53,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:10:53,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:53,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:10:53,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:10:53,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:10:53,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:10:53,818 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 8 states. [2020-07-29 01:10:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:55,762 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2020-07-29 01:10:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:10:55,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-29 01:10:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:10:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2020-07-29 01:10:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:10:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2020-07-29 01:10:55,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 153 transitions. [2020-07-29 01:10:56,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:10:56,091 INFO L225 Difference]: With dead ends: 159 [2020-07-29 01:10:56,091 INFO L226 Difference]: Without dead ends: 159 [2020-07-29 01:10:56,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:10:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-07-29 01:10:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2020-07-29 01:10:56,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:10:56,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 110 states. [2020-07-29 01:10:56,096 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 110 states. [2020-07-29 01:10:56,096 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 110 states. [2020-07-29 01:10:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:56,100 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2020-07-29 01:10:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2020-07-29 01:10:56,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:56,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:56,101 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 159 states. [2020-07-29 01:10:56,102 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 159 states. [2020-07-29 01:10:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:10:56,105 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2020-07-29 01:10:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2020-07-29 01:10:56,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:10:56,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:10:56,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:10:56,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:10:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-29 01:10:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2020-07-29 01:10:56,109 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 22 [2020-07-29 01:10:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:10:56,109 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2020-07-29 01:10:56,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:10:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2020-07-29 01:10:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:10:56,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:10:56,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:10:56,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-07-29 01:10:56,333 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_LEAK, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:10:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:10:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1483091751, now seen corresponding path program 1 times [2020-07-29 01:10:56,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:10:56,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102610873] [2020-07-29 01:10:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-07-29 01:10:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:56,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:10:56,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:10:56,524 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-29 01:10:56,524 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:10:56,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-07-29 01:10:56,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:10:56 BoogieIcfgContainer [2020-07-29 01:10:56,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:10:56,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:10:56,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:10:56,768 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:10:56,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:09:49" (3/4) ... [2020-07-29 01:10:56,774 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:10:56,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:10:56,777 INFO L168 Benchmark]: Toolchain (without parser) took 69182.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -199.8 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:56,777 INFO L168 Benchmark]: CDTParser took 0.31 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:10:56,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:56,780 INFO L168 Benchmark]: Boogie Preprocessor took 106.32 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:10:56,781 INFO L168 Benchmark]: RCFGBuilder took 1529.98 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: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:56,781 INFO L168 Benchmark]: TraceAbstraction took 66816.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -126.9 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:10:56,782 INFO L168 Benchmark]: Witness Printer took 7.03 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:10:56,783 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.31 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 714.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.32 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 1529.98 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: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66816.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -126.9 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.03 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1038. Possible FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L996] list->next = ((void*)0) VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L997] list->colour = BLACK VAL [list={1:0}, malloc(sizeof(SLL))={1:0}] [L999] SLL* end = list; VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1028] EXPR end->colour VAL [end={1:0}, end->colour=1, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1032] EXPR end->colour VAL [end={1:0}, end->colour=1, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={1:0}, end->next={0:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={1:0}, list={1:0}, malloc(sizeof(SLL))={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 128 locations, 55 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 66.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 44.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 1399 SDslu, 2020 SDs, 0 SdLazy, 2692 SolverSat, 154 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 251 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 538 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 292 ConstructedInterpolants, 5 QuantifiedInterpolants, 18295 SizeOfPredicates, 58 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...