./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ldv-memsafety/memleaks_test23_3.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 c34dc3021a28002fd5225add680ad7d25c653bc2 ..................................................................................................................................... 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 -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ldv-memsafety/memleaks_test23_3.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 c34dc3021a28002fd5225add680ad7d25c653bc2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 23:47:30,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 23:47:30,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 23:47:30,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 23:47:30,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 23:47:30,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 23:47:30,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 23:47:30,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 23:47:30,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 23:47:30,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 23:47:30,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 23:47:30,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 23:47:30,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 23:47:30,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 23:47:30,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 23:47:30,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 23:47:30,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 23:47:30,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 23:47:30,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 23:47:30,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 23:47:30,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 23:47:30,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 23:47:30,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 23:47:30,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 23:47:30,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 23:47:30,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 23:47:30,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 23:47:30,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 23:47:30,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 23:47:30,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 23:47:30,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 23:47:30,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 23:47:30,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 23:47:30,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 23:47:30,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 23:47:30,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 23:47:30,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 23:47:30,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 23:47:30,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 23:47:30,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 23:47:30,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 23:47:30,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-09-13 23:47:30,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 23:47:30,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 23:47:30,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 23:47:30,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 23:47:30,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 23:47:30,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 23:47:30,774 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 23:47:30,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 23:47:30,774 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 23:47:30,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-09-13 23:47:30,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 23:47:30,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 23:47:30,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 23:47:30,776 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-09-13 23:47:30,776 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-09-13 23:47:30,776 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-09-13 23:47:30,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 23:47:30,777 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-09-13 23:47:30,777 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 23:47:30,777 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 23:47:30,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 23:47:30,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 23:47:30,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 23:47:30,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:47:30,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 23:47:30,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 23:47:30,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 23:47:30,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 23:47:30,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 23:47:30,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c34dc3021a28002fd5225add680ad7d25c653bc2 [2021-09-13 23:47:31,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 23:47:31,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 23:47:31,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 23:47:31,116 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 23:47:31,117 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 23:47:31,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2021-09-13 23:47:31,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d312eafd3/118deec64d1e4aa29dbd11c7349085ad/FLAG9e0b3d99b [2021-09-13 23:47:31,739 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 23:47:31,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2021-09-13 23:47:31,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d312eafd3/118deec64d1e4aa29dbd11c7349085ad/FLAG9e0b3d99b [2021-09-13 23:47:32,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d312eafd3/118deec64d1e4aa29dbd11c7349085ad [2021-09-13 23:47:32,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 23:47:32,185 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-09-13 23:47:32,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 23:47:32,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 23:47:32,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 23:47:32,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:32" (1/1) ... [2021-09-13 23:47:32,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27773f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:32, skipping insertion in model container [2021-09-13 23:47:32,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:32" (1/1) ... [2021-09-13 23:47:32,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 23:47:32,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:47:32,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:32,584 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-09-13 23:47:32,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57b5c960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:32, skipping insertion in model container [2021-09-13 23:47:32,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 23:47:32,588 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2021-09-13 23:47:32,591 INFO L158 Benchmark]: Toolchain (without parser) took 404.92ms. Allocated memory is still 52.4MB. Free memory was 27.9MB in the beginning and 25.5MB in the end (delta: 2.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-09-13 23:47:32,592 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 52.4MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 23:47:32,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.29ms. Allocated memory is still 52.4MB. Free memory was 27.7MB in the beginning and 25.5MB in the end (delta: 2.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-09-13 23:47:32,594 INFO L339 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.22ms. Allocated memory is still 52.4MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.29ms. Allocated memory is still 52.4MB. Free memory was 27.7MB in the beginning and 25.5MB in the end (delta: 2.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 23:47:34,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 23:47:34,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 23:47:34,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 23:47:34,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 23:47:34,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 23:47:34,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 23:47:34,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 23:47:34,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 23:47:34,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 23:47:34,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 23:47:34,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 23:47:34,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 23:47:34,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 23:47:34,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 23:47:34,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 23:47:34,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 23:47:34,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 23:47:34,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 23:47:34,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 23:47:34,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 23:47:34,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 23:47:34,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 23:47:34,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 23:47:34,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 23:47:34,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 23:47:34,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 23:47:34,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 23:47:34,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 23:47:34,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 23:47:34,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 23:47:34,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 23:47:34,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 23:47:34,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 23:47:34,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 23:47:34,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 23:47:34,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 23:47:34,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 23:47:34,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 23:47:34,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 23:47:34,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 23:47:34,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-09-13 23:47:34,290 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 23:47:34,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 23:47:34,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 23:47:34,291 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 23:47:34,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 23:47:34,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 23:47:34,292 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 23:47:34,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 23:47:34,292 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 23:47:34,292 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-09-13 23:47:34,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 23:47:34,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 23:47:34,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 23:47:34,293 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-09-13 23:47:34,293 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-09-13 23:47:34,293 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-09-13 23:47:34,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 23:47:34,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-09-13 23:47:34,294 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 23:47:34,294 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 23:47:34,294 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 23:47:34,294 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 23:47:34,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 23:47:34,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 23:47:34,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 23:47:34,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:47:34,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 23:47:34,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 23:47:34,295 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 23:47:34,296 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 23:47:34,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 23:47:34,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 23:47:34,296 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c34dc3021a28002fd5225add680ad7d25c653bc2 [2021-09-13 23:47:34,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 23:47:34,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 23:47:34,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 23:47:34,619 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 23:47:34,619 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 23:47:34,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2021-09-13 23:47:34,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6696e5c42/17d48492e63c4239a4dd7c0c87dd105f/FLAG07f6c586a [2021-09-13 23:47:35,220 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 23:47:35,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2021-09-13 23:47:35,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6696e5c42/17d48492e63c4239a4dd7c0c87dd105f/FLAG07f6c586a [2021-09-13 23:47:35,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6696e5c42/17d48492e63c4239a4dd7c0c87dd105f [2021-09-13 23:47:35,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 23:47:35,724 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-09-13 23:47:35,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 23:47:35,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 23:47:35,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 23:47:35,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:35" (1/1) ... [2021-09-13 23:47:35,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7605edfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:35, skipping insertion in model container [2021-09-13 23:47:35,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:35" (1/1) ... [2021-09-13 23:47:35,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 23:47:35,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:47:36,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:36,168 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-09-13 23:47:36,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:47:36,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:36,259 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 23:47:36,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:36,397 INFO L208 MainTranslator]: Completed translation [2021-09-13 23:47:36,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36 WrapperNode [2021-09-13 23:47:36,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 23:47:36,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 23:47:36,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 23:47:36,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 23:47:36,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 23:47:36,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 23:47:36,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 23:47:36,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 23:47:36,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (1/1) ... [2021-09-13 23:47:36,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:47:36,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 23:47:36,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 23:47:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 23:47:36,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-09-13 23:47:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 23:47:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-09-13 23:47:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-09-13 23:47:36,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-09-13 23:47:36,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-09-13 23:47:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2021-09-13 23:47:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2021-09-13 23:47:36,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2021-09-13 23:47:36,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2021-09-13 23:47:36,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2021-09-13 23:47:36,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2021-09-13 23:47:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2021-09-13 23:47:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2021-09-13 23:47:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2021-09-13 23:47:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2021-09-13 23:47:36,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2021-09-13 23:47:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2021-09-13 23:47:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2021-09-13 23:47:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2021-09-13 23:47:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2021-09-13 23:47:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2021-09-13 23:47:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-09-13 23:47:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2021-09-13 23:47:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2021-09-13 23:47:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2021-09-13 23:47:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2021-09-13 23:47:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-09-13 23:47:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2021-09-13 23:47:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure fetch_item [2021-09-13 23:47:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_register_report [2021-09-13 23:47:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_parser_main [2021-09-13 23:47:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2021-09-13 23:47:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_open_report [2021-09-13 23:47:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_device [2021-09-13 23:47:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_23 [2021-09-13 23:47:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_23 [2021-09-13 23:47:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2021-09-13 23:47:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-09-13 23:47:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-09-13 23:47:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-09-13 23:47:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-09-13 23:47:36,606 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-09-13 23:47:36,606 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-09-13 23:47:36,606 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-09-13 23:47:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-09-13 23:47:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-09-13 23:47:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-09-13 23:47:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-09-13 23:47:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-09-13 23:47:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-09-13 23:47:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-09-13 23:47:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-09-13 23:47:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-09-13 23:47:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-09-13 23:47:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-09-13 23:47:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-09-13 23:47:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-09-13 23:47:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-09-13 23:47:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-09-13 23:47:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-09-13 23:47:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-09-13 23:47:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-09-13 23:47:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-09-13 23:47:36,615 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-09-13 23:47:36,616 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-09-13 23:47:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-09-13 23:47:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-09-13 23:47:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-09-13 23:47:36,617 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-09-13 23:47:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-09-13 23:47:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-09-13 23:47:36,620 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-09-13 23:47:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-09-13 23:47:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-09-13 23:47:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-09-13 23:47:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-09-13 23:47:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-09-13 23:47:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-09-13 23:47:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-09-13 23:47:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-09-13 23:47:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-09-13 23:47:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-09-13 23:47:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-09-13 23:47:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-09-13 23:47:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-09-13 23:47:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-09-13 23:47:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-09-13 23:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-09-13 23:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-09-13 23:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-09-13 23:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-09-13 23:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-09-13 23:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-09-13 23:47:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-09-13 23:47:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-09-13 23:47:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-09-13 23:47:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-09-13 23:47:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2021-09-13 23:47:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2021-09-13 23:47:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2021-09-13 23:47:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure g [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure fetch_item [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure hid_register_report [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure hid_parser_main [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure hid_open_report [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 23:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_device [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure probe_23 [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_23 [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-09-13 23:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-09-13 23:47:37,343 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-09-13 23:47:37,636 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-09-13 23:47:37,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 23:47:37,777 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-09-13 23:47:37,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:37 BoogieIcfgContainer [2021-09-13 23:47:37,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 23:47:37,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 23:47:37,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 23:47:37,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 23:47:37,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 11:47:35" (1/3) ... [2021-09-13 23:47:37,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698c2ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:47:37, skipping insertion in model container [2021-09-13 23:47:37,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:36" (2/3) ... [2021-09-13 23:47:37,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698c2ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:47:37, skipping insertion in model container [2021-09-13 23:47:37,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:37" (3/3) ... [2021-09-13 23:47:37,787 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test23_3.i [2021-09-13 23:47:37,791 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 23:47:37,792 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2021-09-13 23:47:37,829 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 23:47:37,835 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 23:47:37,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2021-09-13 23:47:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 175 states have (on average 1.6914285714285715) internal successors, (296), 275 states have internal predecessors, (296), 31 states have call successors, (31), 26 states have call predecessors, (31), 26 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-09-13 23:47:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:37,867 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:37,868 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:37,868 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 121 more)] === [2021-09-13 23:47:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash -878224449, now seen corresponding path program 1 times [2021-09-13 23:47:37,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:37,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134225713] [2021-09-13 23:47:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:37,885 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:37,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 23:47:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 23:47:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:38,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2021-09-13 23:47:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:38,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:38,281 INFO L388 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 [2021-09-13 23:47:38,466 INFO L264 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2021-09-13 23:47:38,466 INFO L281 TraceCheckUtils]: 1: Hoare triple {337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {337#true} is VALID [2021-09-13 23:47:38,467 INFO L281 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2021-09-13 23:47:38,467 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} #666#return; {337#true} is VALID [2021-09-13 23:47:38,467 INFO L264 TraceCheckUtils]: 4: Hoare triple {337#true} call main(); {337#true} is VALID [2021-09-13 23:47:38,467 INFO L264 TraceCheckUtils]: 5: Hoare triple {337#true} call entry_point(); {337#true} is VALID [2021-09-13 23:47:38,467 INFO L264 TraceCheckUtils]: 6: Hoare triple {337#true} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {337#true} is VALID [2021-09-13 23:47:38,467 INFO L281 TraceCheckUtils]: 7: Hoare triple {337#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {337#true} is VALID [2021-09-13 23:47:38,468 INFO L264 TraceCheckUtils]: 8: Hoare triple {337#true} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {337#true} is VALID [2021-09-13 23:47:38,468 INFO L281 TraceCheckUtils]: 9: Hoare triple {337#true} ~size := #in~size; {337#true} is VALID [2021-09-13 23:47:38,469 INFO L281 TraceCheckUtils]: 10: Hoare triple {337#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:38,470 INFO L281 TraceCheckUtils]: 11: Hoare triple {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} assume true; {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:38,471 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} {337#true} #590#return; {379#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |probe_23_#t~ret59.base|)) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,472 INFO L281 TraceCheckUtils]: 13: Hoare triple {379#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |probe_23_#t~ret59.base|)) (_ bv1 1)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,472 INFO L281 TraceCheckUtils]: 14: Hoare triple {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,474 INFO L264 TraceCheckUtils]: 15: Hoare triple {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {390#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,474 INFO L281 TraceCheckUtils]: 16: Hoare triple {390#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {394#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,475 INFO L281 TraceCheckUtils]: 17: Hoare triple {394#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))) (_ bv1 1)))} assume !(1bv1 == #valid[~list.base]); {338#false} is VALID [2021-09-13 23:47:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:38,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:38,775 INFO L281 TraceCheckUtils]: 17: Hoare triple {394#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))) (_ bv1 1)))} assume !(1bv1 == #valid[~list.base]); {338#false} is VALID [2021-09-13 23:47:38,776 INFO L281 TraceCheckUtils]: 16: Hoare triple {390#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {394#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,777 INFO L264 TraceCheckUtils]: 15: Hoare triple {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {390#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,777 INFO L281 TraceCheckUtils]: 14: Hoare triple {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,778 INFO L281 TraceCheckUtils]: 13: Hoare triple {379#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |probe_23_#t~ret59.base|)) (_ bv1 1)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {383#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,788 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} {337#true} #590#return; {379#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |probe_23_#t~ret59.base|)) (_ bv1 1)))} is VALID [2021-09-13 23:47:38,789 INFO L281 TraceCheckUtils]: 11: Hoare triple {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} assume true; {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:38,790 INFO L281 TraceCheckUtils]: 10: Hoare triple {337#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {372#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:38,790 INFO L281 TraceCheckUtils]: 9: Hoare triple {337#true} ~size := #in~size; {337#true} is VALID [2021-09-13 23:47:38,790 INFO L264 TraceCheckUtils]: 8: Hoare triple {337#true} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {337#true} is VALID [2021-09-13 23:47:38,790 INFO L281 TraceCheckUtils]: 7: Hoare triple {337#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {337#true} is VALID [2021-09-13 23:47:38,791 INFO L264 TraceCheckUtils]: 6: Hoare triple {337#true} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {337#true} is VALID [2021-09-13 23:47:38,791 INFO L264 TraceCheckUtils]: 5: Hoare triple {337#true} call entry_point(); {337#true} is VALID [2021-09-13 23:47:38,791 INFO L264 TraceCheckUtils]: 4: Hoare triple {337#true} call main(); {337#true} is VALID [2021-09-13 23:47:38,791 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} #666#return; {337#true} is VALID [2021-09-13 23:47:38,791 INFO L281 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2021-09-13 23:47:38,791 INFO L281 TraceCheckUtils]: 1: Hoare triple {337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {337#true} is VALID [2021-09-13 23:47:38,792 INFO L264 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2021-09-13 23:47:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:38,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:38,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134225713] [2021-09-13 23:47:38,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134225713] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:38,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:38,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-09-13 23:47:38,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109451419] [2021-09-13 23:47:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:38,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:38,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:38,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:38,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 23:47:38,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 23:47:38,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-09-13 23:47:38,861 INFO L87 Difference]: Start difference. First operand has 334 states, 175 states have (on average 1.6914285714285715) internal successors, (296), 275 states have internal predecessors, (296), 31 states have call successors, (31), 26 states have call predecessors, (31), 26 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:42,675 INFO L93 Difference]: Finished difference Result 255 states and 271 transitions. [2021-09-13 23:47:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 23:47:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2021-09-13 23:47:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2021-09-13 23:47:42,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 276 transitions. [2021-09-13 23:47:42,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:42,992 INFO L225 Difference]: With dead ends: 255 [2021-09-13 23:47:42,993 INFO L226 Difference]: Without dead ends: 252 [2021-09-13 23:47:42,995 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 99.74ms TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 23:47:42,997 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1700.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.10ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1714.95ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:42,998 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 245 Invalid, 1270 Unknown, 0 Unchecked, 12.10ms Time], IncrementalHoareTripleChecker [3 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1714.95ms Time] [2021-09-13 23:47:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-09-13 23:47:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2021-09-13 23:47:43,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:43,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 244 states, 125 states have (on average 1.72) internal successors, (215), 201 states have internal predecessors, (215), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:43,037 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 244 states, 125 states have (on average 1.72) internal successors, (215), 201 states have internal predecessors, (215), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:43,038 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 244 states, 125 states have (on average 1.72) internal successors, (215), 201 states have internal predecessors, (215), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:43,053 INFO L93 Difference]: Finished difference Result 252 states and 268 transitions. [2021-09-13 23:47:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 268 transitions. [2021-09-13 23:47:43,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:43,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:43,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 125 states have (on average 1.72) internal successors, (215), 201 states have internal predecessors, (215), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Second operand 252 states. [2021-09-13 23:47:43,058 INFO L87 Difference]: Start difference. First operand has 244 states, 125 states have (on average 1.72) internal successors, (215), 201 states have internal predecessors, (215), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Second operand 252 states. [2021-09-13 23:47:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:43,070 INFO L93 Difference]: Finished difference Result 252 states and 268 transitions. [2021-09-13 23:47:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 268 transitions. [2021-09-13 23:47:43,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:43,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:43,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:43,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 125 states have (on average 1.72) internal successors, (215), 201 states have internal predecessors, (215), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 261 transitions. [2021-09-13 23:47:43,085 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 261 transitions. Word has length 18 [2021-09-13 23:47:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:43,086 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 261 transitions. [2021-09-13 23:47:43,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 261 transitions. [2021-09-13 23:47:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:43,087 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:43,087 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:43,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:43,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:43,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 121 more)] === [2021-09-13 23:47:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash -878224448, now seen corresponding path program 1 times [2021-09-13 23:47:43,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:43,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958894711] [2021-09-13 23:47:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:43,294 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:43,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:43,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 23:47:43,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 23:47:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:43,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 23:47:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:43,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:43,543 INFO L388 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 [2021-09-13 23:47:43,777 INFO L264 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2021-09-13 23:47:43,777 INFO L281 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {1456#true} is VALID [2021-09-13 23:47:43,778 INFO L281 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2021-09-13 23:47:43,778 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #666#return; {1456#true} is VALID [2021-09-13 23:47:43,778 INFO L264 TraceCheckUtils]: 4: Hoare triple {1456#true} call main(); {1456#true} is VALID [2021-09-13 23:47:43,778 INFO L264 TraceCheckUtils]: 5: Hoare triple {1456#true} call entry_point(); {1456#true} is VALID [2021-09-13 23:47:43,778 INFO L264 TraceCheckUtils]: 6: Hoare triple {1456#true} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {1456#true} is VALID [2021-09-13 23:47:43,779 INFO L281 TraceCheckUtils]: 7: Hoare triple {1456#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {1456#true} is VALID [2021-09-13 23:47:43,779 INFO L264 TraceCheckUtils]: 8: Hoare triple {1456#true} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {1456#true} is VALID [2021-09-13 23:47:43,779 INFO L281 TraceCheckUtils]: 9: Hoare triple {1456#true} ~size := #in~size; {1488#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2021-09-13 23:47:43,781 INFO L281 TraceCheckUtils]: 10: Hoare triple {1488#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1492#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:43,781 INFO L281 TraceCheckUtils]: 11: Hoare triple {1492#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1492#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:43,782 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {1492#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1456#true} #590#return; {1499#(and (= |probe_23_#t~ret59.offset| (_ bv0 32)) (= (select |#length| |probe_23_#t~ret59.base|) (_ bv1036 32)))} is VALID [2021-09-13 23:47:43,783 INFO L281 TraceCheckUtils]: 13: Hoare triple {1499#(and (= |probe_23_#t~ret59.offset| (_ bv0 32)) (= (select |#length| |probe_23_#t~ret59.base|) (_ bv1036 32)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {1503#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:43,783 INFO L281 TraceCheckUtils]: 14: Hoare triple {1503#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {1503#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:43,784 INFO L264 TraceCheckUtils]: 15: Hoare triple {1503#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {1510#(and (= (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (= (_ bv1036 32) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} is VALID [2021-09-13 23:47:43,785 INFO L281 TraceCheckUtils]: 16: Hoare triple {1510#(and (= (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (= (_ bv1036 32) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {1514#(and (= (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (= (_ bv1036 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)))} is VALID [2021-09-13 23:47:43,785 INFO L281 TraceCheckUtils]: 17: Hoare triple {1514#(and (= (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (= (_ bv1036 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {1457#false} is VALID [2021-09-13 23:47:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:43,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:44,422 INFO L281 TraceCheckUtils]: 17: Hoare triple {1518#(and (bvule (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (bvule LDV_INIT_LIST_HEAD_~list.offset (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {1457#false} is VALID [2021-09-13 23:47:44,423 INFO L281 TraceCheckUtils]: 16: Hoare triple {1522#(and (bvule (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)) (bvule |LDV_INIT_LIST_HEAD_#in~list.offset| (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {1518#(and (bvule (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (bvule LDV_INIT_LIST_HEAD_~list.offset (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset)))} is VALID [2021-09-13 23:47:44,455 INFO L264 TraceCheckUtils]: 15: Hoare triple {1526#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {1522#(and (bvule (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)) (bvule |LDV_INIT_LIST_HEAD_#in~list.offset| (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|)))} is VALID [2021-09-13 23:47:44,456 INFO L281 TraceCheckUtils]: 14: Hoare triple {1526#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {1526#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} is VALID [2021-09-13 23:47:44,457 INFO L281 TraceCheckUtils]: 13: Hoare triple {1533#(and (bvule (bvadd (_ bv4 32) |probe_23_#t~ret59.offset|) (bvadd (_ bv8 32) |probe_23_#t~ret59.offset|)) (bvule (bvadd (_ bv8 32) |probe_23_#t~ret59.offset|) (select |#length| |probe_23_#t~ret59.base|)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {1526#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} is VALID [2021-09-13 23:47:44,459 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {1540#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} {1456#true} #590#return; {1533#(and (bvule (bvadd (_ bv4 32) |probe_23_#t~ret59.offset|) (bvadd (_ bv8 32) |probe_23_#t~ret59.offset|)) (bvule (bvadd (_ bv8 32) |probe_23_#t~ret59.offset|) (select |#length| |probe_23_#t~ret59.base|)))} is VALID [2021-09-13 23:47:44,459 INFO L281 TraceCheckUtils]: 11: Hoare triple {1540#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} assume true; {1540#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:47:44,461 INFO L281 TraceCheckUtils]: 10: Hoare triple {1547#(or (bvule (_ bv8 32) ldv_malloc_~size) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1540#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:47:44,461 INFO L281 TraceCheckUtils]: 9: Hoare triple {1456#true} ~size := #in~size; {1547#(or (bvule (_ bv8 32) ldv_malloc_~size) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:47:44,462 INFO L264 TraceCheckUtils]: 8: Hoare triple {1456#true} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L281 TraceCheckUtils]: 7: Hoare triple {1456#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L264 TraceCheckUtils]: 6: Hoare triple {1456#true} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L264 TraceCheckUtils]: 5: Hoare triple {1456#true} call entry_point(); {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L264 TraceCheckUtils]: 4: Hoare triple {1456#true} call main(); {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #666#return; {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L281 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L281 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {1456#true} is VALID [2021-09-13 23:47:44,462 INFO L264 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2021-09-13 23:47:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:44,463 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:44,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958894711] [2021-09-13 23:47:44,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958894711] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:44,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:44,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-09-13 23:47:44,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555585067] [2021-09-13 23:47:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2021-09-13 23:47:44,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:44,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:44,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:44,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 23:47:44,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 23:47:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-09-13 23:47:44,535 INFO L87 Difference]: Start difference. First operand 244 states and 261 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:54,455 INFO L93 Difference]: Finished difference Result 250 states and 266 transitions. [2021-09-13 23:47:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 23:47:54,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2021-09-13 23:47:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions. [2021-09-13 23:47:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions. [2021-09-13 23:47:54,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 268 transitions. [2021-09-13 23:47:54,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:54,722 INFO L225 Difference]: With dead ends: 250 [2021-09-13 23:47:54,722 INFO L226 Difference]: Without dead ends: 250 [2021-09-13 23:47:54,723 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 417.40ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-09-13 23:47:54,724 INFO L928 BasicCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4281.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.63ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4305.44ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:54,724 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 432 Invalid, 2308 Unknown, 0 Unchecked, 21.63ms Time], IncrementalHoareTripleChecker [2 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 4305.44ms Time] [2021-09-13 23:47:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-09-13 23:47:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2021-09-13 23:47:54,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:54,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 244 states, 125 states have (on average 1.704) internal successors, (213), 201 states have internal predecessors, (213), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:54,736 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 244 states, 125 states have (on average 1.704) internal successors, (213), 201 states have internal predecessors, (213), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:54,737 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 244 states, 125 states have (on average 1.704) internal successors, (213), 201 states have internal predecessors, (213), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:54,752 INFO L93 Difference]: Finished difference Result 250 states and 266 transitions. [2021-09-13 23:47:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 266 transitions. [2021-09-13 23:47:54,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:54,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:54,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 125 states have (on average 1.704) internal successors, (213), 201 states have internal predecessors, (213), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Second operand 250 states. [2021-09-13 23:47:54,755 INFO L87 Difference]: Start difference. First operand has 244 states, 125 states have (on average 1.704) internal successors, (213), 201 states have internal predecessors, (213), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) Second operand 250 states. [2021-09-13 23:47:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:54,769 INFO L93 Difference]: Finished difference Result 250 states and 266 transitions. [2021-09-13 23:47:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 266 transitions. [2021-09-13 23:47:54,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:54,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:54,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:54,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 125 states have (on average 1.704) internal successors, (213), 201 states have internal predecessors, (213), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2021-09-13 23:47:54,785 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 18 [2021-09-13 23:47:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:54,785 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2021-09-13 23:47:54,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2021-09-13 23:47:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:54,786 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:54,786 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:54,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:54,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:54,996 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 121 more)] === [2021-09-13 23:47:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:54,997 INFO L82 PathProgramCache]: Analyzing trace with hash 864585886, now seen corresponding path program 1 times [2021-09-13 23:47:54,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:54,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002128490] [2021-09-13 23:47:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:54,997 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:54,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 23:47:55,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 23:47:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:55,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 23:47:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:55,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:55,278 INFO L264 TraceCheckUtils]: 0: Hoare triple {2575#true} call ULTIMATE.init(); {2575#true} is VALID [2021-09-13 23:47:55,278 INFO L281 TraceCheckUtils]: 1: Hoare triple {2575#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {2575#true} is VALID [2021-09-13 23:47:55,278 INFO L281 TraceCheckUtils]: 2: Hoare triple {2575#true} assume true; {2575#true} is VALID [2021-09-13 23:47:55,279 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {2575#true} {2575#true} #666#return; {2575#true} is VALID [2021-09-13 23:47:55,279 INFO L264 TraceCheckUtils]: 4: Hoare triple {2575#true} call main(); {2575#true} is VALID [2021-09-13 23:47:55,279 INFO L264 TraceCheckUtils]: 5: Hoare triple {2575#true} call entry_point(); {2575#true} is VALID [2021-09-13 23:47:55,279 INFO L264 TraceCheckUtils]: 6: Hoare triple {2575#true} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {2575#true} is VALID [2021-09-13 23:47:55,279 INFO L281 TraceCheckUtils]: 7: Hoare triple {2575#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {2575#true} is VALID [2021-09-13 23:47:55,280 INFO L264 TraceCheckUtils]: 8: Hoare triple {2575#true} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {2575#true} is VALID [2021-09-13 23:47:55,280 INFO L281 TraceCheckUtils]: 9: Hoare triple {2575#true} ~size := #in~size; {2575#true} is VALID [2021-09-13 23:47:55,281 INFO L281 TraceCheckUtils]: 10: Hoare triple {2575#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,281 INFO L281 TraceCheckUtils]: 11: Hoare triple {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,282 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2575#true} #590#return; {2617#(and (= |probe_23_#t~ret59.base| (_ bv0 32)) (= |probe_23_#t~ret59.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,283 INFO L281 TraceCheckUtils]: 13: Hoare triple {2617#(and (= |probe_23_#t~ret59.base| (_ bv0 32)) (= |probe_23_#t~ret59.offset| (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {2621#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,283 INFO L281 TraceCheckUtils]: 14: Hoare triple {2621#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {2576#false} is VALID [2021-09-13 23:47:55,283 INFO L264 TraceCheckUtils]: 15: Hoare triple {2576#false} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {2576#false} is VALID [2021-09-13 23:47:55,284 INFO L281 TraceCheckUtils]: 16: Hoare triple {2576#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {2576#false} is VALID [2021-09-13 23:47:55,284 INFO L281 TraceCheckUtils]: 17: Hoare triple {2576#false} assume !(1bv1 == #valid[~list.base]); {2576#false} is VALID [2021-09-13 23:47:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:55,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:55,451 INFO L281 TraceCheckUtils]: 17: Hoare triple {2576#false} assume !(1bv1 == #valid[~list.base]); {2576#false} is VALID [2021-09-13 23:47:55,451 INFO L281 TraceCheckUtils]: 16: Hoare triple {2576#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {2576#false} is VALID [2021-09-13 23:47:55,452 INFO L264 TraceCheckUtils]: 15: Hoare triple {2576#false} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {2576#false} is VALID [2021-09-13 23:47:55,452 INFO L281 TraceCheckUtils]: 14: Hoare triple {2621#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {2576#false} is VALID [2021-09-13 23:47:55,453 INFO L281 TraceCheckUtils]: 13: Hoare triple {2617#(and (= |probe_23_#t~ret59.base| (_ bv0 32)) (= |probe_23_#t~ret59.offset| (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {2621#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,454 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2575#true} #590#return; {2617#(and (= |probe_23_#t~ret59.base| (_ bv0 32)) (= |probe_23_#t~ret59.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,454 INFO L281 TraceCheckUtils]: 11: Hoare triple {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,454 INFO L281 TraceCheckUtils]: 10: Hoare triple {2575#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2610#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,455 INFO L281 TraceCheckUtils]: 9: Hoare triple {2575#true} ~size := #in~size; {2575#true} is VALID [2021-09-13 23:47:55,455 INFO L264 TraceCheckUtils]: 8: Hoare triple {2575#true} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {2575#true} is VALID [2021-09-13 23:47:55,455 INFO L281 TraceCheckUtils]: 7: Hoare triple {2575#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {2575#true} is VALID [2021-09-13 23:47:55,457 INFO L264 TraceCheckUtils]: 6: Hoare triple {2575#true} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {2575#true} is VALID [2021-09-13 23:47:55,457 INFO L264 TraceCheckUtils]: 5: Hoare triple {2575#true} call entry_point(); {2575#true} is VALID [2021-09-13 23:47:55,457 INFO L264 TraceCheckUtils]: 4: Hoare triple {2575#true} call main(); {2575#true} is VALID [2021-09-13 23:47:55,457 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {2575#true} {2575#true} #666#return; {2575#true} is VALID [2021-09-13 23:47:55,457 INFO L281 TraceCheckUtils]: 2: Hoare triple {2575#true} assume true; {2575#true} is VALID [2021-09-13 23:47:55,458 INFO L281 TraceCheckUtils]: 1: Hoare triple {2575#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {2575#true} is VALID [2021-09-13 23:47:55,458 INFO L264 TraceCheckUtils]: 0: Hoare triple {2575#true} call ULTIMATE.init(); {2575#true} is VALID [2021-09-13 23:47:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:55,459 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:55,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002128490] [2021-09-13 23:47:55,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002128490] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:55,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:55,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-09-13 23:47:55,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30835844] [2021-09-13 23:47:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:55,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:55,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:55,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:55,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 23:47:55,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 23:47:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 23:47:55,477 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:57,573 INFO L93 Difference]: Finished difference Result 237 states and 251 transitions. [2021-09-13 23:47:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 23:47:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2021-09-13 23:47:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2021-09-13 23:47:57,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 252 transitions. [2021-09-13 23:47:57,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:57,793 INFO L225 Difference]: With dead ends: 237 [2021-09-13 23:47:57,793 INFO L226 Difference]: Without dead ends: 237 [2021-09-13 23:47:57,794 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.67ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 23:47:57,795 INFO L928 BasicCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 909.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.30ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 913.86ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:57,795 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 816 Unknown, 0 Unchecked, 5.30ms Time], IncrementalHoareTripleChecker [1 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 913.86ms Time] [2021-09-13 23:47:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-09-13 23:47:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2021-09-13 23:47:57,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:57,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 235 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 193 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2021-09-13 23:47:57,806 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 235 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 193 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2021-09-13 23:47:57,807 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 235 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 193 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2021-09-13 23:47:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:57,813 INFO L93 Difference]: Finished difference Result 237 states and 251 transitions. [2021-09-13 23:47:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 251 transitions. [2021-09-13 23:47:57,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:57,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:57,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 193 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Second operand 237 states. [2021-09-13 23:47:57,815 INFO L87 Difference]: Start difference. First operand has 235 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 193 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Second operand 237 states. [2021-09-13 23:47:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:57,822 INFO L93 Difference]: Finished difference Result 237 states and 251 transitions. [2021-09-13 23:47:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 251 transitions. [2021-09-13 23:47:57,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:57,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:57,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:57,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 193 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2021-09-13 23:47:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 249 transitions. [2021-09-13 23:47:57,830 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 249 transitions. Word has length 18 [2021-09-13 23:47:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:57,831 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 249 transitions. [2021-09-13 23:47:57,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 249 transitions. [2021-09-13 23:47:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 23:47:57,832 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:57,832 INFO L513 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] [2021-09-13 23:47:57,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:58,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:58,041 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting probe_23Err0REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 121 more)] === [2021-09-13 23:47:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1389767262, now seen corresponding path program 1 times [2021-09-13 23:47:58,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:58,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015300082] [2021-09-13 23:47:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:58,043 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:58,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:58,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 23:47:58,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 23:47:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:58,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 23:47:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:58,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:58,211 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-09-13 23:47:58,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 26 [2021-09-13 23:47:58,466 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-09-13 23:47:58,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-09-13 23:47:59,574 INFO L264 TraceCheckUtils]: 0: Hoare triple {3633#true} call ULTIMATE.init(); {3633#true} is VALID [2021-09-13 23:47:59,576 INFO L281 TraceCheckUtils]: 1: Hoare triple {3633#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,577 INFO L281 TraceCheckUtils]: 2: Hoare triple {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} assume true; {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,577 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} {3633#true} #666#return; {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,578 INFO L264 TraceCheckUtils]: 4: Hoare triple {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call main(); {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,578 INFO L264 TraceCheckUtils]: 5: Hoare triple {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call entry_point(); {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,579 INFO L264 TraceCheckUtils]: 6: Hoare triple {3641#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {3657#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,580 INFO L281 TraceCheckUtils]: 7: Hoare triple {3657#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1)))} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:59,581 INFO L264 TraceCheckUtils]: 8: Hoare triple {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {3665#(= |old(#valid)| |#valid|)} is VALID [2021-09-13 23:47:59,581 INFO L281 TraceCheckUtils]: 9: Hoare triple {3665#(= |old(#valid)| |#valid|)} ~size := #in~size; {3665#(= |old(#valid)| |#valid|)} is VALID [2021-09-13 23:47:59,583 INFO L281 TraceCheckUtils]: 10: Hoare triple {3665#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3672#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2021-09-13 23:47:59,583 INFO L281 TraceCheckUtils]: 11: Hoare triple {3672#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} assume true; {3672#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2021-09-13 23:47:59,586 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {3672#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} #590#return; {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:59,587 INFO L281 TraceCheckUtils]: 13: Hoare triple {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:59,587 INFO L281 TraceCheckUtils]: 14: Hoare triple {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:59,591 INFO L264 TraceCheckUtils]: 15: Hoare triple {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:59,591 INFO L281 TraceCheckUtils]: 16: Hoare triple {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:59,592 INFO L281 TraceCheckUtils]: 17: Hoare triple {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:59,592 INFO L281 TraceCheckUtils]: 18: Hoare triple {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:59,593 INFO L281 TraceCheckUtils]: 19: Hoare triple {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} assume true; {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:59,594 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {3689#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} #592#return; {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:59,595 INFO L281 TraceCheckUtils]: 21: Hoare triple {3679#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} assume !(1bv1 == #valid[~dev.base]); {3634#false} is VALID [2021-09-13 23:47:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:59,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:48:12,419 INFO L281 TraceCheckUtils]: 21: Hoare triple {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} assume !(1bv1 == #valid[~dev.base]); {3634#false} is VALID [2021-09-13 23:48:12,420 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {3633#true} {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} #592#return; {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:48:12,420 INFO L281 TraceCheckUtils]: 19: Hoare triple {3633#true} assume true; {3633#true} is VALID [2021-09-13 23:48:12,420 INFO L281 TraceCheckUtils]: 18: Hoare triple {3633#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {3633#true} is VALID [2021-09-13 23:48:12,420 INFO L281 TraceCheckUtils]: 17: Hoare triple {3633#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {3633#true} is VALID [2021-09-13 23:48:12,421 INFO L281 TraceCheckUtils]: 16: Hoare triple {3633#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3633#true} is VALID [2021-09-13 23:48:12,421 INFO L264 TraceCheckUtils]: 15: Hoare triple {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {3633#true} is VALID [2021-09-13 23:48:12,421 INFO L281 TraceCheckUtils]: 14: Hoare triple {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:48:12,422 INFO L281 TraceCheckUtils]: 13: Hoare triple {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} ~p~1.base, ~p~1.offset := #t~ret59.base, #t~ret59.offset;havoc #t~ret59.base, #t~ret59.offset; {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:48:12,423 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {3739#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} {3735#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) probe_23_~dev.base)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} #590#return; {3661#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:48:12,424 INFO L281 TraceCheckUtils]: 11: Hoare triple {3739#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} assume true; {3739#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:48:12,426 INFO L281 TraceCheckUtils]: 10: Hoare triple {3746#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3739#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:48:12,426 INFO L281 TraceCheckUtils]: 9: Hoare triple {3746#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} ~size := #in~size; {3746#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:48:12,428 INFO L264 TraceCheckUtils]: 8: Hoare triple {3735#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) probe_23_~dev.base)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} call #t~ret59.base, #t~ret59.offset := ldv_malloc(1036bv32); {3746#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:48:12,428 INFO L281 TraceCheckUtils]: 7: Hoare triple {3753#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |probe_23_#in~dev.base|)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {3735#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) probe_23_~dev.base)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} is VALID [2021-09-13 23:48:12,429 INFO L264 TraceCheckUtils]: 6: Hoare triple {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} call #t~ret61 := probe_23(~#dev~0.base, ~#dev~0.offset); {3753#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |probe_23_#in~dev.base|)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} is VALID [2021-09-13 23:48:12,430 INFO L264 TraceCheckUtils]: 5: Hoare triple {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} call entry_point(); {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:48:12,431 INFO L264 TraceCheckUtils]: 4: Hoare triple {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} call main(); {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:48:12,431 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} {3633#true} #666#return; {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:48:12,432 INFO L281 TraceCheckUtils]: 2: Hoare triple {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} assume true; {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:48:12,434 INFO L281 TraceCheckUtils]: 1: Hoare triple {3633#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {3757#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:48:12,434 INFO L264 TraceCheckUtils]: 0: Hoare triple {3633#true} call ULTIMATE.init(); {3633#true} is VALID [2021-09-13 23:48:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:48:12,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:48:12,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015300082] [2021-09-13 23:48:12,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015300082] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:48:12,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:48:12,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2021-09-13 23:48:12,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113702517] [2021-09-13 23:48:12,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2021-09-13 23:48:12,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:48:12,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:48:12,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:48:12,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 23:48:12,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:48:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 23:48:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=142, Unknown=5, NotChecked=0, Total=182 [2021-09-13 23:48:12,518 INFO L87 Difference]: Start difference. First operand 235 states and 249 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:48:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 23:48:19,817 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 16546.92ms TimeCoverageRelationStatistics Valid=70, Invalid=265, Unknown=7, NotChecked=0, Total=342 [2021-09-13 23:48:19,817 INFO L928 BasicCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 433.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.59ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 817 IncrementalHoareTripleChecker+Unchecked, 438.27ms IncrementalHoareTripleChecker+Time [2021-09-13 23:48:19,818 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 158 Invalid, 1166 Unknown, 0 Unchecked, 5.59ms Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 817 Unchecked, 438.27ms Time] [2021-09-13 23:48:19,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 23:48:20,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:48:20,019 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.createAssertionError(ChainingHoareTripleChecker.java:367) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveReturn(ChainingHoareTripleChecker.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkReturn(ChainingHoareTripleChecker.java:311) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkReturn(ChainingHoareTripleChecker.java:123) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkReturn(CachingHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$ReturnSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.returnSuccessors(TotalizeNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.returnSuccessors(ComplementDeterministicNwa.java:142) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessors(ProductNwa.java:284) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessorsGivenHier(ProductNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addReturnsAndSuccessors(NestedWordAutomatonReachableStates.java:1118) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:950) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-09-13 23:48:20,024 INFO L158 Benchmark]: Toolchain (without parser) took 44299.77ms. Allocated memory was 56.6MB in the beginning and 109.1MB in the end (delta: 52.4MB). Free memory was 33.3MB in the beginning and 42.7MB in the end (delta: -9.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2021-09-13 23:48:20,027 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 23:48:20,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.90ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 35.6MB in the end (delta: -2.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2021-09-13 23:48:20,029 INFO L158 Benchmark]: Boogie Preprocessor took 124.48ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 45.1MB in the end (delta: -9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 23:48:20,029 INFO L158 Benchmark]: RCFGBuilder took 1255.67ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 45.1MB in the beginning and 63.4MB in the end (delta: -18.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2021-09-13 23:48:20,030 INFO L158 Benchmark]: TraceAbstraction took 42241.28ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 62.9MB in the beginning and 42.7MB in the end (delta: 20.2MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2021-09-13 23:48:20,031 INFO L339 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.18ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.90ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 35.6MB in the end (delta: -2.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.48ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 45.1MB in the end (delta: -9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1255.67ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 45.1MB in the beginning and 63.4MB in the end (delta: -18.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42241.28ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 62.9MB in the beginning and 42.7MB in the end (delta: 20.2MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.createAssertionError(ChainingHoareTripleChecker.java:367) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 23:48:20,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...