./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 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_test15-1.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 e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:41,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:41,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:41,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:41,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:41,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:41,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:41,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:41,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:41,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:41,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:41,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:41,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:41,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:41,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:41,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:41,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:41,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:41,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:41,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:41,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:41,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:41,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:41,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:41,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:41,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:41,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:41,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:41,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:41,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:41,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:41,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:41,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:41,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:41,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:41,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:41,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:41,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:41,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:41,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:41,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:41,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:50:41,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:41,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:41,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:41,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:41,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:41,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:41,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:41,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:41,417 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:41,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:41,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:41,418 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:41,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:41,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:41,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:41,419 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:41,419 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:41,419 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:41,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:41,419 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:41,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:41,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:41,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:41,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:41,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:41,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:41,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:41,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:41,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:50:41,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:50:41,423 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 -> e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a [2022-02-20 23:50:41,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:41,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:41,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:41,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:41,669 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:41,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2022-02-20 23:50:41,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa744b009/e8962f7257f7431a87acf00bf43f4e85/FLAGeb09c0e4d [2022-02-20 23:50:42,119 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:42,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2022-02-20 23:50:42,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa744b009/e8962f7257f7431a87acf00bf43f4e85/FLAGeb09c0e4d [2022-02-20 23:50:42,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa744b009/e8962f7257f7431a87acf00bf43f4e85 [2022-02-20 23:50:42,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:42,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:42,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:42,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:42,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:42,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:42" (1/1) ... [2022-02-20 23:50:42,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4b18cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:42, skipping insertion in model container [2022-02-20 23:50:42,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:42" (1/1) ... [2022-02-20 23:50:42,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:42,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:42,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:43,004 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) [2022-02-20 23:50:43,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d8d0bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:43, skipping insertion in model container [2022-02-20 23:50:43,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:43,008 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:50:43,011 INFO L158 Benchmark]: Toolchain (without parser) took 514.62ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 46.0MB in the beginning and 87.9MB in the end (delta: -41.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:43,012 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:50:43,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.79ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 45.8MB in the beginning and 87.9MB in the end (delta: -42.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:43,014 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.15ms. Allocated memory is still 86.0MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.79ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 45.8MB in the beginning and 87.9MB in the end (delta: -42.1MB). Peak memory consumption was 11.1MB. 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_test15-1.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 e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:44,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:44,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:44,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:44,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:44,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:44,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:44,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:44,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:44,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:44,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:44,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:44,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:44,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:44,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:44,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:44,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:44,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:44,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:44,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:44,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:44,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:44,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:44,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:44,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:44,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:44,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:44,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:44,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:44,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:44,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:44,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:44,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:44,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:44,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:44,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:44,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:44,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:44,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:44,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:44,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:44,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:50:44,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:44,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:44,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:44,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:44,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:44,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:44,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:44,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:44,856 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:44,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:44,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:44,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:44,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:44,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:44,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:44,858 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:44,858 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:44,858 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:44,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:44,859 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:44,859 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:50:44,859 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:50:44,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:44,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:44,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:44,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:44,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:44,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:44,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:44,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:44,861 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:50:44,861 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:44,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:50:44,862 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 -> e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a [2022-02-20 23:50:45,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:45,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:45,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:45,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:45,193 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:45,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2022-02-20 23:50:45,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b395b26/d4d8e859af34430b94d3b01fca503a77/FLAG91d9283ae [2022-02-20 23:50:45,751 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:45,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2022-02-20 23:50:45,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b395b26/d4d8e859af34430b94d3b01fca503a77/FLAG91d9283ae [2022-02-20 23:50:46,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b395b26/d4d8e859af34430b94d3b01fca503a77 [2022-02-20 23:50:46,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:46,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:46,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:46,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:46,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:46,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d646d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46, skipping insertion in model container [2022-02-20 23:50:46,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:46,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:46,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:46,552 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:50:46,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:46,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:46,642 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:50:46,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:46,752 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:50:46,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46 WrapperNode [2022-02-20 23:50:46,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:46,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:46,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:50:46,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:50:46,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,835 INFO L137 Inliner]: procedures = 176, calls = 103, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 170 [2022-02-20 23:50:46,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:46,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:50:46,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:50:46,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:50:46,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:50:46,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:50:46,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:50:46,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:50:46,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (1/1) ... [2022-02-20 23:50:46,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:50:46,907 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) [2022-02-20 23:50:46,917 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 [2022-02-20 23:50:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 23:50:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:50:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 23:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:50:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:50:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:50:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 23:50:46,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 23:50:46,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:50:46,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:50:47,167 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:50:47,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:50:47,657 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:50:47,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:50:47,669 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:50:47,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:47 BoogieIcfgContainer [2022-02-20 23:50:47,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:50:47,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:50:47,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:50:47,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:50:47,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:50:46" (1/3) ... [2022-02-20 23:50:47,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a01891d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:47, skipping insertion in model container [2022-02-20 23:50:47,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:46" (2/3) ... [2022-02-20 23:50:47,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a01891d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:47, skipping insertion in model container [2022-02-20 23:50:47,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:47" (3/3) ... [2022-02-20 23:50:47,686 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test15-1.i [2022-02-20 23:50:47,690 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:50:47,690 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-02-20 23:50:47,726 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:50:47,732 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, mAutomataTypeConcurrency=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 [2022-02-20 23:50:47,732 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-02-20 23:50:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 73 states have (on average 1.821917808219178) internal successors, (133), 123 states have internal predecessors, (133), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:50:47,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:47,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:47,757 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:50:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:47,766 INFO L85 PathProgramCache]: Analyzing trace with hash -599633160, now seen corresponding path program 1 times [2022-02-20 23:50:47,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:47,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213501024] [2022-02-20 23:50:47,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:47,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:47,783 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) [2022-02-20 23:50:47,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:50:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:47,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:50:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:47,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:48,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {132#true} is VALID [2022-02-20 23:50:48,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {132#true} is VALID [2022-02-20 23:50:48,008 INFO L272 TraceCheckUtils]: 2: Hoare triple {132#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {132#true} is VALID [2022-02-20 23:50:48,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {146#(not (= |ldv_zalloc_#t~malloc13#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:48,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#(not (= |ldv_zalloc_#t~malloc13#1.base| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {150#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:48,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} assume true; {150#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:48,012 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {150#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} {132#true} #188#return; {157#(not (= |ULTIMATE.start_entry_point_#t~ret53#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:48,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(not (= |ULTIMATE.start_entry_point_#t~ret53#1.base| (_ bv0 32)))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {161#(not (= |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:48,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#(not (= |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 32)))} assume entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32; {133#false} is VALID [2022-02-20 23:50:48,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume { :end_inline_entry_point } true; {133#false} is VALID [2022-02-20 23:50:48,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} assume !(#valid == main_old_#valid#1); {133#false} is VALID [2022-02-20 23:50:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:48,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:48,016 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:48,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213501024] [2022-02-20 23:50:48,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213501024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:48,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:48,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:48,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819968330] [2022-02-20 23:50:48,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:50:48,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:48,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:48,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:48,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:48,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:48,076 INFO L87 Difference]: Start difference. First operand has 129 states, 73 states have (on average 1.821917808219178) internal successors, (133), 123 states have internal predecessors, (133), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,039 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:50:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:50:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-02-20 23:50:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-02-20 23:50:49,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 141 transitions. [2022-02-20 23:50:49,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:49,232 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:50:49,232 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:50:49,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:49,236 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:49,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 515 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:50:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 23:50:49,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:49,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:49,274 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:49,275 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,284 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-02-20 23:50:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-02-20 23:50:49,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:49,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:49,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 127 states. [2022-02-20 23:50:49,287 INFO L87 Difference]: Start difference. First operand has 127 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 127 states. [2022-02-20 23:50:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,299 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-02-20 23:50:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-02-20 23:50:49,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:49,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:49,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:49,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2022-02-20 23:50:49,306 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 11 [2022-02-20 23:50:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:49,307 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2022-02-20 23:50:49,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-02-20 23:50:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:50:49,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:49,308 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:49,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:49,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:49,523 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:50:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash 518474697, now seen corresponding path program 1 times [2022-02-20 23:50:49,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:49,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4903431] [2022-02-20 23:50:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:49,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:49,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:49,526 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) [2022-02-20 23:50:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:50:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:49,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:50:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:49,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:49,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {682#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {682#true} is VALID [2022-02-20 23:50:49,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {682#true} is VALID [2022-02-20 23:50:49,677 INFO L272 TraceCheckUtils]: 2: Hoare triple {682#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {682#true} is VALID [2022-02-20 23:50:49,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {682#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {682#true} is VALID [2022-02-20 23:50:49,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {682#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {682#true} is VALID [2022-02-20 23:50:49,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} assume true; {682#true} is VALID [2022-02-20 23:50:49,678 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {682#true} {682#true} #188#return; {682#true} is VALID [2022-02-20 23:50:49,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {682#true} is VALID [2022-02-20 23:50:49,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {682#true} is VALID [2022-02-20 23:50:49,678 INFO L272 TraceCheckUtils]: 9: Hoare triple {682#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {682#true} is VALID [2022-02-20 23:50:49,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {682#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {717#(not (= |ldv_zalloc_#t~malloc13#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(not (= |ldv_zalloc_#t~malloc13#1.base| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {721#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {721#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} assume true; {721#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,694 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {721#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} {682#true} #190#return; {728#(not (= |ULTIMATE.start_entry_point_#t~ret54#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(not (= |ULTIMATE.start_entry_point_#t~ret54#1.base| (_ bv0 32)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {732#(not (= |ULTIMATE.start_entry_point_~intf~2#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {732#(not (= |ULTIMATE.start_entry_point_~intf~2#1.base| (_ bv0 32)))} assume entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32; {683#false} is VALID [2022-02-20 23:50:49,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {683#false} assume !(0bv32 == entry_point_~hdev~0#1.offset); {683#false} is VALID [2022-02-20 23:50:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:49,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:49,696 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:49,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4903431] [2022-02-20 23:50:49,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4903431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:49,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:49,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:49,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711099318] [2022-02-20 23:50:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 23:50:49,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:49,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:49,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:49,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:49,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:49,715 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,498 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-02-20 23:50:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 23:50:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2022-02-20 23:50:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2022-02-20 23:50:50,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 138 transitions. [2022-02-20 23:50:50,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:50,655 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:50:50,655 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:50:50,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:50,661 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:50,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 474 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:50:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 23:50:50,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:50,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:50,675 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:50,676 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,681 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-02-20 23:50:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-02-20 23:50:50,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:50,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:50,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 127 states. [2022-02-20 23:50:50,688 INFO L87 Difference]: Start difference. First operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 127 states. [2022-02-20 23:50:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,694 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-02-20 23:50:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-02-20 23:50:50,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:50,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:50,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:50,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-02-20 23:50:50,702 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 17 [2022-02-20 23:50:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:50,702 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-02-20 23:50:50,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-02-20 23:50:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:50:50,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:50,704 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:50,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:50:50,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:50,913 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:50:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash -222458304, now seen corresponding path program 1 times [2022-02-20 23:50:50,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:50,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678774749] [2022-02-20 23:50:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:50,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:50,915 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) [2022-02-20 23:50:50,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:50:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:51,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:51,074 INFO L390 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 [2022-02-20 23:50:51,255 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:50:51,255 INFO L390 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 17 treesize of output 24 [2022-02-20 23:50:51,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {1248#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {1248#true} is VALID [2022-02-20 23:50:51,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1248#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {1248#true} is VALID [2022-02-20 23:50:51,276 INFO L272 TraceCheckUtils]: 2: Hoare triple {1248#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {1248#true} is VALID [2022-02-20 23:50:51,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {1248#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {1248#true} is VALID [2022-02-20 23:50:51,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {1248#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {1248#true} is VALID [2022-02-20 23:50:51,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1248#true} assume true; {1248#true} is VALID [2022-02-20 23:50:51,277 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1248#true} {1248#true} #188#return; {1248#true} is VALID [2022-02-20 23:50:51,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1248#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {1248#true} is VALID [2022-02-20 23:50:51,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1248#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {1248#true} is VALID [2022-02-20 23:50:51,277 INFO L272 TraceCheckUtils]: 9: Hoare triple {1248#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {1248#true} is VALID [2022-02-20 23:50:51,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {1283#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} assume true; {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,283 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} {1248#true} #190#return; {1294#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|))} is VALID [2022-02-20 23:50:51,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {1294#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:50:51,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:50:51,284 INFO L272 TraceCheckUtils]: 16: Hoare triple {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {1305#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:51,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {1305#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {1309#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_20 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_20) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|))))} is VALID [2022-02-20 23:50:51,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_20 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_20) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {1309#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_20 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_20) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|))))} is VALID [2022-02-20 23:50:51,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_20 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_20) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|))))} assume true; {1309#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_20 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_20) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|))))} is VALID [2022-02-20 23:50:51,289 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1309#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_20 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_20) |#valid|)) (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|))))} {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} #192#return; {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:50:51,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} assume !(1bv1 == #valid[entry_point_~intf~2#1.base]); {1249#false} is VALID [2022-02-20 23:50:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:51,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:51,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} assume !(1bv1 == #valid[entry_point_~intf~2#1.base]); {1249#false} is VALID [2022-02-20 23:50:51,685 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} #192#return; {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:50:51,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} assume true; {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:51,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:51,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:51,690 INFO L272 TraceCheckUtils]: 16: Hoare triple {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {1328#(forall ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~intf~2#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:51,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:50:51,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {1294#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {1298#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:50:51,692 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} {1248#true} #190#return; {1294#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|))} is VALID [2022-02-20 23:50:51,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} assume true; {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {1287#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {1283#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:51,696 INFO L272 TraceCheckUtils]: 9: Hoare triple {1248#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {1248#true} is VALID [2022-02-20 23:50:51,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1248#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {1248#true} is VALID [2022-02-20 23:50:51,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1248#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {1248#true} is VALID [2022-02-20 23:50:51,697 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1248#true} {1248#true} #188#return; {1248#true} is VALID [2022-02-20 23:50:51,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1248#true} assume true; {1248#true} is VALID [2022-02-20 23:50:51,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {1248#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {1248#true} is VALID [2022-02-20 23:50:51,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {1248#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {1248#true} is VALID [2022-02-20 23:50:51,698 INFO L272 TraceCheckUtils]: 2: Hoare triple {1248#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {1248#true} is VALID [2022-02-20 23:50:51,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1248#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {1248#true} is VALID [2022-02-20 23:50:51,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {1248#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {1248#true} is VALID [2022-02-20 23:50:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:51,699 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:51,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678774749] [2022-02-20 23:50:51,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678774749] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:51,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:51,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-02-20 23:50:51,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439301167] [2022-02-20 23:50:51,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:51,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-02-20 23:50:51,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:51,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:51,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:51,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:51,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:51,731 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,092 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-02-20 23:50:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:50:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-02-20 23:50:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2022-02-20 23:50:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2022-02-20 23:50:53,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 182 transitions. [2022-02-20 23:50:53,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:53,292 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:50:53,292 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:50:53,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:50:53,293 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:53,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 523 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 147 Unchecked, 0.4s Time] [2022-02-20 23:50:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:50:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2022-02-20 23:50:53,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:53,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 144 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 137 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:53,299 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 144 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 137 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:53,299 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 144 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 137 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,304 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-02-20 23:50:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2022-02-20 23:50:53,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 137 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 165 states. [2022-02-20 23:50:53,305 INFO L87 Difference]: Start difference. First operand has 144 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 137 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 165 states. [2022-02-20 23:50:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,309 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-02-20 23:50:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2022-02-20 23:50:53,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:53,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 137 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 165 transitions. [2022-02-20 23:50:53,314 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 165 transitions. Word has length 22 [2022-02-20 23:50:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:53,314 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 165 transitions. [2022-02-20 23:50:53,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2022-02-20 23:50:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:50:53,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:53,315 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:53,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:53,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,524 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:50:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash -222458303, now seen corresponding path program 1 times [2022-02-20 23:50:53,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:53,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267014177] [2022-02-20 23:50:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:53,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:53,526 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) [2022-02-20 23:50:53,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:50:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:50:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:53,671 INFO L390 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 [2022-02-20 23:50:53,677 INFO L390 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 [2022-02-20 23:50:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:53,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:53,963 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:53,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:50:53,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {2030#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {2030#true} is VALID [2022-02-20 23:50:53,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2030#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {2030#true} is VALID [2022-02-20 23:50:53,990 INFO L272 TraceCheckUtils]: 2: Hoare triple {2030#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {2030#true} is VALID [2022-02-20 23:50:53,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {2030#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2030#true} is VALID [2022-02-20 23:50:53,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {2030#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2030#true} is VALID [2022-02-20 23:50:53,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {2030#true} assume true; {2030#true} is VALID [2022-02-20 23:50:53,991 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2030#true} {2030#true} #188#return; {2030#true} is VALID [2022-02-20 23:50:53,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {2030#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {2030#true} is VALID [2022-02-20 23:50:53,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {2030#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {2030#true} is VALID [2022-02-20 23:50:53,991 INFO L272 TraceCheckUtils]: 9: Hoare triple {2030#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {2030#true} is VALID [2022-02-20 23:50:53,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {2030#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2065#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:53,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:53,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} assume true; {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:53,998 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} {2030#true} #190#return; {2076#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret54#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|)))} is VALID [2022-02-20 23:50:53,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret54#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:50:53,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:50:54,000 INFO L272 TraceCheckUtils]: 16: Hoare triple {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {2087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:54,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {2087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} is VALID [2022-02-20 23:50:54,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} is VALID [2022-02-20 23:50:54,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} assume true; {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} is VALID [2022-02-20 23:50:54,004 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} #192#return; {2101#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:50:54,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {2101#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, entry_point_~intf~2#1.offset)), #length[entry_point_~intf~2#1.base]) && ~bvule32(~bvadd32(4bv32, entry_point_~intf~2#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, entry_point_~intf~2#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, entry_point_~intf~2#1.offset))); {2031#false} is VALID [2022-02-20 23:50:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:54,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:56,287 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:56,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267014177] [2022-02-20 23:50:56,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267014177] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:56,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [247332031] [2022-02-20 23:50:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:56,288 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:56,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:56,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-02-20 23:50:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:56,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:50:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:56,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:56,556 INFO L390 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 [2022-02-20 23:50:56,563 INFO L390 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 [2022-02-20 23:50:58,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:58,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:58,783 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:58,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:50:58,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {2030#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {2030#true} is VALID [2022-02-20 23:50:58,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2030#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {2030#true} is VALID [2022-02-20 23:50:58,795 INFO L272 TraceCheckUtils]: 2: Hoare triple {2030#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {2030#true} is VALID [2022-02-20 23:50:58,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {2030#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2030#true} is VALID [2022-02-20 23:50:58,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {2030#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2030#true} is VALID [2022-02-20 23:50:58,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2030#true} assume true; {2030#true} is VALID [2022-02-20 23:50:58,796 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2030#true} {2030#true} #188#return; {2030#true} is VALID [2022-02-20 23:50:58,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {2030#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {2030#true} is VALID [2022-02-20 23:50:58,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2030#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {2030#true} is VALID [2022-02-20 23:50:58,798 INFO L272 TraceCheckUtils]: 9: Hoare triple {2030#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {2030#true} is VALID [2022-02-20 23:50:58,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {2030#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2065#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:58,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:58,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} assume true; {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:58,803 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2069#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} {2030#true} #190#return; {2076#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret54#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|)))} is VALID [2022-02-20 23:50:58,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret54#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret54#1.base|)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:50:58,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:50:58,806 INFO L272 TraceCheckUtils]: 16: Hoare triple {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {2087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:58,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {2087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} is VALID [2022-02-20 23:50:58,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} is VALID [2022-02-20 23:50:58,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} assume true; {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} is VALID [2022-02-20 23:50:58,814 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2091#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_36 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_36)))))} {2080#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} #192#return; {2101#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:50:58,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {2101#(and (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (= (_ bv20 32) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, entry_point_~intf~2#1.offset)), #length[entry_point_~intf~2#1.base]) && ~bvule32(~bvadd32(4bv32, entry_point_~intf~2#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, entry_point_~intf~2#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, entry_point_~intf~2#1.offset))); {2031#false} is VALID [2022-02-20 23:50:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:58,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:59,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [247332031] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:59,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:59,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-02-20 23:50:59,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585073187] [2022-02-20 23:50:59,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:59,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-02-20 23:50:59,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:59,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:59,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:59,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:59,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:59,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:59,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:50:59,070 INFO L87 Difference]: Start difference. First operand 144 states and 165 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,040 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2022-02-20 23:51:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:01,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-02-20 23:51:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2022-02-20 23:51:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2022-02-20 23:51:01,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 199 transitions. [2022-02-20 23:51:01,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:01,255 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:51:01,255 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:51:01,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2022-02-20 23:51:01,256 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 161 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:01,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 452 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 63 Unchecked, 0.6s Time] [2022-02-20 23:51:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:51:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2022-02-20 23:51:01,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:01,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 155 states, 105 states have (on average 1.6666666666666667) internal successors, (175), 148 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:01,263 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 155 states, 105 states have (on average 1.6666666666666667) internal successors, (175), 148 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:01,263 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 155 states, 105 states have (on average 1.6666666666666667) internal successors, (175), 148 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,270 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2022-02-20 23:51:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2022-02-20 23:51:01,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:01,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:01,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 105 states have (on average 1.6666666666666667) internal successors, (175), 148 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 184 states. [2022-02-20 23:51:01,271 INFO L87 Difference]: Start difference. First operand has 155 states, 105 states have (on average 1.6666666666666667) internal successors, (175), 148 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 184 states. [2022-02-20 23:51:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,276 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2022-02-20 23:51:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2022-02-20 23:51:01,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:01,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:01,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:01,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 105 states have (on average 1.6666666666666667) internal successors, (175), 148 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2022-02-20 23:51:01,281 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 22 [2022-02-20 23:51:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:01,281 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2022-02-20 23:51:01,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2022-02-20 23:51:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:51:01,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:01,282 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:01,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:01,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:01,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:01,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:01,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash -126280059, now seen corresponding path program 1 times [2022-02-20 23:51:01,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:01,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98958665] [2022-02-20 23:51:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:01,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:01,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:01,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:01,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:51:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:01,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:01,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:01,853 INFO L390 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 [2022-02-20 23:51:01,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:01,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:51:01,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {2892#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {2892#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L272 TraceCheckUtils]: 2: Hoare triple {2892#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {2892#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {2892#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {2892#true} assume true; {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2892#true} {2892#true} #188#return; {2892#true} is VALID [2022-02-20 23:51:01,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2892#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {2892#true} is VALID [2022-02-20 23:51:01,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {2892#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {2892#true} is VALID [2022-02-20 23:51:01,949 INFO L272 TraceCheckUtils]: 9: Hoare triple {2892#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {2892#true} is VALID [2022-02-20 23:51:01,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {2892#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2892#true} is VALID [2022-02-20 23:51:01,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {2892#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2892#true} is VALID [2022-02-20 23:51:01,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {2892#true} assume true; {2892#true} is VALID [2022-02-20 23:51:01,949 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2892#true} {2892#true} #190#return; {2892#true} is VALID [2022-02-20 23:51:01,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {2892#true} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {2892#true} is VALID [2022-02-20 23:51:01,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {2892#true} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {2892#true} is VALID [2022-02-20 23:51:01,950 INFO L272 TraceCheckUtils]: 16: Hoare triple {2892#true} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {2892#true} is VALID [2022-02-20 23:51:01,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {2892#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {2948#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:01,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {2948#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {2952#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:01,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {2952#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} assume true; {2952#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:01,953 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2952#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} {2892#true} #192#return; {2959#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret55#1.base|))} is VALID [2022-02-20 23:51:01,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {2959#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret55#1.base|))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:51:01,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:51:01,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:51:01,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:51:01,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {2963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {2976#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem57#1.base|))} is VALID [2022-02-20 23:51:01,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {2976#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem57#1.base|))} assume !(1bv1 == #valid[entry_point_#t~mem57#1.base]); {2893#false} is VALID [2022-02-20 23:51:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:01,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:01,958 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:01,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98958665] [2022-02-20 23:51:01,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98958665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:01,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:01,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:51:01,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288886931] [2022-02-20 23:51:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-20 23:51:01,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:01,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:01,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:01,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:01,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:01,994 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:03,223 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2022-02-20 23:51:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-20 23:51:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-02-20 23:51:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-02-20 23:51:03,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 135 transitions. [2022-02-20 23:51:03,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:03,353 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:51:03,353 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:51:03,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:51:03,354 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 10 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:03,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 494 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:51:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:51:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-02-20 23:51:03,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:03,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 154 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:03,360 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 154 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:03,360 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 154 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:03,364 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2022-02-20 23:51:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-02-20 23:51:03,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:03,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:03,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 155 states. [2022-02-20 23:51:03,365 INFO L87 Difference]: Start difference. First operand has 154 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 155 states. [2022-02-20 23:51:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:03,368 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2022-02-20 23:51:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-02-20 23:51:03,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:03,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:03,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:03,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2022-02-20 23:51:03,373 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 27 [2022-02-20 23:51:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:03,373 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2022-02-20 23:51:03,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2022-02-20 23:51:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:51:03,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:03,374 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:03,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:03,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:03,582 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash -126280058, now seen corresponding path program 1 times [2022-02-20 23:51:03,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:03,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832622170] [2022-02-20 23:51:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:03,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:03,584 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:03,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:51:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:03,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:51:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:03,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:03,747 INFO L390 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 [2022-02-20 23:51:03,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:03,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:03,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:51:03,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:51:03,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {3604#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L272 TraceCheckUtils]: 2: Hoare triple {3604#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {3604#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {3604#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3604#true} {3604#true} #188#return; {3604#true} is VALID [2022-02-20 23:51:03,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {3604#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {3604#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L272 TraceCheckUtils]: 9: Hoare triple {3604#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {3604#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {3604#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3604#true} {3604#true} #190#return; {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {3604#true} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {3604#true} is VALID [2022-02-20 23:51:03,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#true} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {3604#true} is VALID [2022-02-20 23:51:03,953 INFO L272 TraceCheckUtils]: 16: Hoare triple {3604#true} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {3604#true} is VALID [2022-02-20 23:51:03,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {3604#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {3660#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:03,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {3660#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {3664#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:03,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {3664#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)))} assume true; {3664#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:03,956 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3664#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)))} {3604#true} #192#return; {3671#(and (= |ULTIMATE.start_entry_point_#t~ret55#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret55#1.base|) (_ bv9 32)))} is VALID [2022-02-20 23:51:03,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {3671#(and (= |ULTIMATE.start_entry_point_#t~ret55#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret55#1.base|) (_ bv9 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:03,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:03,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:03,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:03,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {3675#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv9 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {3688#(and (= |ULTIMATE.start_entry_point_#t~mem57#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_#t~mem57#1.base|) (_ bv9 32)))} is VALID [2022-02-20 23:51:03,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {3688#(and (= |ULTIMATE.start_entry_point_#t~mem57#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_#t~mem57#1.base|) (_ bv9 32)))} assume !((~bvule32(~bvadd32(1bv32, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset)), #length[entry_point_#t~mem57#1.base]) && ~bvule32(~bvadd32(7bv32, entry_point_#t~mem57#1.offset), ~bvadd32(1bv32, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset)))) && ~bvule32(0bv32, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset))); {3605#false} is VALID [2022-02-20 23:51:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:03,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:03,961 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:03,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832622170] [2022-02-20 23:51:03,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832622170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:03,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:03,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:51:03,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098271033] [2022-02-20 23:51:03,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:03,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-20 23:51:03,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:03,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:03,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:03,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:03,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:03,992 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:05,571 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2022-02-20 23:51:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-20 23:51:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-02-20 23:51:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-02-20 23:51:05,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 142 transitions. [2022-02-20 23:51:05,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:05,701 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:51:05,701 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:51:05,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:51:05,702 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 17 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:05,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 533 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:51:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:51:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2022-02-20 23:51:05,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:05,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 153 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:05,707 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 153 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:05,708 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 153 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:05,712 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2022-02-20 23:51:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2022-02-20 23:51:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:05,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:05,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 163 states. [2022-02-20 23:51:05,713 INFO L87 Difference]: Start difference. First operand has 153 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 163 states. [2022-02-20 23:51:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:05,717 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2022-02-20 23:51:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2022-02-20 23:51:05,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:05,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:05,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:05,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2022-02-20 23:51:05,722 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 27 [2022-02-20 23:51:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:05,722 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2022-02-20 23:51:05,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2022-02-20 23:51:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:51:05,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:05,723 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:05,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:51:05,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:05,932 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash -126277696, now seen corresponding path program 1 times [2022-02-20 23:51:05,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:05,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991728668] [2022-02-20 23:51:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:05,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:05,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:05,934 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:05,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:51:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:06,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:51:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:06,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:06,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:06,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {4339#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L272 TraceCheckUtils]: 2: Hoare triple {4339#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {4339#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {4339#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} assume true; {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4339#true} {4339#true} #188#return; {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {4339#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {4339#true} is VALID [2022-02-20 23:51:06,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {4339#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L272 TraceCheckUtils]: 9: Hoare triple {4339#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {4339#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {4339#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {4339#true} assume true; {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4339#true} {4339#true} #190#return; {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {4339#true} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {4339#true} is VALID [2022-02-20 23:51:06,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {4339#true} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {4339#true} is VALID [2022-02-20 23:51:06,162 INFO L272 TraceCheckUtils]: 16: Hoare triple {4339#true} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {4339#true} is VALID [2022-02-20 23:51:06,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {4395#(not (= |ldv_zalloc_#t~malloc13#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {4395#(not (= |ldv_zalloc_#t~malloc13#1.base| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {4399#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {4399#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} assume true; {4399#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,164 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4399#(not (= |ldv_zalloc_#res#1.base| (_ bv0 32)))} {4339#true} #192#return; {4406#(not (= |ULTIMATE.start_entry_point_#t~ret55#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {4406#(not (= |ULTIMATE.start_entry_point_#t~ret55#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {4410#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:06,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {4410#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {4410#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:06,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {4410#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (_ bv0 32)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {4417#(not (= |ULTIMATE.start_entry_point_#t~mem56#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {4417#(not (= |ULTIMATE.start_entry_point_#t~mem56#1.base| (_ bv0 32)))} assume entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32;havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {4340#false} is VALID [2022-02-20 23:51:06,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {4340#false} assume 0bv32 == entry_point_~intf~2#1.offset; {4340#false} is VALID [2022-02-20 23:51:06,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {4340#false} assume !~bvult32(entry_point_~intf~2#1.base, #StackHeapBarrier); {4340#false} is VALID [2022-02-20 23:51:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:06,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:06,168 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:06,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991728668] [2022-02-20 23:51:06,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991728668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:06,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:06,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:51:06,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968068569] [2022-02-20 23:51:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:06,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-20 23:51:06,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:06,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:06,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:06,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:06,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:06,191 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,040 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2022-02-20 23:51:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:07,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-02-20 23:51:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-02-20 23:51:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-02-20 23:51:07,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 129 transitions. [2022-02-20 23:51:07,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:07,177 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:51:07,177 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:51:07,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:51:07,178 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:07,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 701 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:51:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-02-20 23:51:07,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:07,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 143 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:07,183 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 143 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:07,183 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 143 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,190 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2022-02-20 23:51:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2022-02-20 23:51:07,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 143 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 150 states. [2022-02-20 23:51:07,195 INFO L87 Difference]: Start difference. First operand has 150 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 143 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 150 states. [2022-02-20 23:51:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,201 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2022-02-20 23:51:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2022-02-20 23:51:07,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:07,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 143 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2022-02-20 23:51:07,206 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 27 [2022-02-20 23:51:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:07,206 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2022-02-20 23:51:07,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2022-02-20 23:51:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:51:07,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:07,207 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:07,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:07,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:07,413 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1096052090, now seen corresponding path program 1 times [2022-02-20 23:51:07,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:07,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247069246] [2022-02-20 23:51:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:07,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:07,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:07,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:51:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:51:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:07,546 INFO L390 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 [2022-02-20 23:51:07,683 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:51:07,683 INFO L390 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 17 treesize of output 24 [2022-02-20 23:51:11,777 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:51:11,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:51:11,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:11,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-02-20 23:51:11,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {5032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {5032#true} is VALID [2022-02-20 23:51:11,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {5032#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {5032#true} is VALID [2022-02-20 23:51:11,908 INFO L272 TraceCheckUtils]: 2: Hoare triple {5032#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {5032#true} is VALID [2022-02-20 23:51:11,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {5032#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5046#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {5046#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} assume true; {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,912 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} {5032#true} #188#return; {5057#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {5057#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,913 INFO L272 TraceCheckUtils]: 9: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {5068#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:11,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {5068#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5072#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_132 (_ BitVec 1))) (= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_132)))))} is VALID [2022-02-20 23:51:11,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {5072#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_132 (_ BitVec 1))) (= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_132)))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5072#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_132 (_ BitVec 1))) (= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_132)))))} is VALID [2022-02-20 23:51:11,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {5072#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_132 (_ BitVec 1))) (= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_132)))))} assume true; {5072#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_132 (_ BitVec 1))) (= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_132)))))} is VALID [2022-02-20 23:51:11,918 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5072#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_132 (_ BitVec 1))) (= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_132)))))} {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} #190#return; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,919 INFO L272 TraceCheckUtils]: 16: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {5068#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:11,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {5068#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5094#(= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (_ bv1 1)) |#valid|)} is VALID [2022-02-20 23:51:11,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {5094#(= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (_ bv1 1)) |#valid|)} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5098#(= (store |old(#valid)| |ldv_zalloc_#res#1.base| (_ bv1 1)) |#valid|)} is VALID [2022-02-20 23:51:11,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {5098#(= (store |old(#valid)| |ldv_zalloc_#res#1.base| (_ bv1 1)) |#valid|)} assume true; {5098#(= (store |old(#valid)| |ldv_zalloc_#res#1.base| (_ bv1 1)) |#valid|)} is VALID [2022-02-20 23:51:11,922 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5098#(= (store |old(#valid)| |ldv_zalloc_#res#1.base| (_ bv1 1)) |#valid|)} {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} #192#return; {5105#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret55#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:51:11,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {5105#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~ret55#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:51:11,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:51:11,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:51:11,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:51:11,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {5109#(and (= (bvneg (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))) (_ bv1 1)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:11,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~hdev~0#1.base]); {5033#false} is VALID [2022-02-20 23:51:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 3 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:51:11,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:14,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~hdev~0#1.base]); {5033#false} is VALID [2022-02-20 23:51:14,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,387 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} #192#return; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} assume true; {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,391 INFO L272 TraceCheckUtils]: 16: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,394 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} #190#return; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} assume true; {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,397 INFO L272 TraceCheckUtils]: 9: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {5158#(forall ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:51:14,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {5057#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {5061#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,399 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} {5032#true} #188#return; {5057#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} assume true; {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {5046#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5050#(= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {5032#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5046#(= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:14,402 INFO L272 TraceCheckUtils]: 2: Hoare triple {5032#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {5032#true} is VALID [2022-02-20 23:51:14,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {5032#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {5032#true} is VALID [2022-02-20 23:51:14,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {5032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {5032#true} is VALID [2022-02-20 23:51:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:51:14,403 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:14,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247069246] [2022-02-20 23:51:14,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247069246] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:14,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:14,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 12 [2022-02-20 23:51:14,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520765216] [2022-02-20 23:51:14,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2022-02-20 23:51:14,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:14,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:51:14,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:14,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:51:14,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:51:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2022-02-20 23:51:14,454 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:51:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,015 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:51:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:51:22,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2022-02-20 23:51:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:51:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2022-02-20 23:51:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:51:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2022-02-20 23:51:22,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 171 transitions. [2022-02-20 23:51:22,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:22,204 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:51:22,204 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:51:22,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=56, Invalid=213, Unknown=3, NotChecked=0, Total=272 [2022-02-20 23:51:22,204 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:22,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 534 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 61 Unchecked, 0.5s Time] [2022-02-20 23:51:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:51:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-02-20 23:51:22,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:22,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 153 states, 105 states have (on average 1.619047619047619) internal successors, (170), 145 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:22,209 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 153 states, 105 states have (on average 1.619047619047619) internal successors, (170), 145 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:22,209 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 153 states, 105 states have (on average 1.619047619047619) internal successors, (170), 145 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,225 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:51:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-02-20 23:51:22,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:22,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:22,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 105 states have (on average 1.619047619047619) internal successors, (170), 145 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:51:22,227 INFO L87 Difference]: Start difference. First operand has 153 states, 105 states have (on average 1.619047619047619) internal successors, (170), 145 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 170 states. [2022-02-20 23:51:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:22,230 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-02-20 23:51:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-02-20 23:51:22,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:22,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:22,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:22,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 105 states have (on average 1.619047619047619) internal successors, (170), 145 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2022-02-20 23:51:22,237 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 29 [2022-02-20 23:51:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:22,237 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2022-02-20 23:51:22,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 23:51:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2022-02-20 23:51:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:51:22,238 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:22,238 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:22,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 23:51:22,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:22,447 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1096052089, now seen corresponding path program 1 times [2022-02-20 23:51:22,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:22,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776141874] [2022-02-20 23:51:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:22,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:22,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:22,450 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:22,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:51:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:22,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:51:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:22,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:22,581 INFO L390 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 [2022-02-20 23:51:22,587 INFO L390 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 [2022-02-20 23:51:22,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:22,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:51:22,855 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:51:22,855 INFO L390 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 17 treesize of output 24 [2022-02-20 23:51:23,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:23,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:51:23,030 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:23,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:51:23,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {5886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {5886#true} is VALID [2022-02-20 23:51:23,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {5886#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {5886#true} is VALID [2022-02-20 23:51:23,113 INFO L272 TraceCheckUtils]: 2: Hoare triple {5886#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {5886#true} is VALID [2022-02-20 23:51:23,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {5886#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5900#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {5900#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:23,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} assume true; {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:23,117 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} {5886#true} #188#return; {5911#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv12 32)) (= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:23,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {5911#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv12 32)) (= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32)))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,118 INFO L272 TraceCheckUtils]: 9: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:51:23,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} is VALID [2022-02-20 23:51:23,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} is VALID [2022-02-20 23:51:23,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} assume true; {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} is VALID [2022-02-20 23:51:23,124 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} #190#return; {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,126 INFO L272 TraceCheckUtils]: 16: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:51:23,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} is VALID [2022-02-20 23:51:23,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} is VALID [2022-02-20 23:51:23,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} assume true; {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} is VALID [2022-02-20 23:51:23,135 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} #192#return; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:23,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset)), #length[entry_point_~hdev~0#1.base]) && ~bvule32(~bvadd32(8bv32, entry_point_~hdev~0#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset))); {5887#false} is VALID [2022-02-20 23:51:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:51:23,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:25,500 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:25,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776141874] [2022-02-20 23:51:25,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776141874] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:51:25,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [901787027] [2022-02-20 23:51:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:51:25,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:51:25,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-02-20 23:51:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:25,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:51:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:25,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:25,702 INFO L390 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 [2022-02-20 23:51:25,718 INFO L390 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 [2022-02-20 23:51:25,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:25,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:51:25,927 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:51:25,928 INFO L390 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 17 treesize of output 24 [2022-02-20 23:51:28,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:51:28,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:51:28,089 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:28,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:51:28,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {5886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {5886#true} is VALID [2022-02-20 23:51:28,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {5886#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {5886#true} is VALID [2022-02-20 23:51:28,160 INFO L272 TraceCheckUtils]: 2: Hoare triple {5886#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {5886#true} is VALID [2022-02-20 23:51:28,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {5886#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5900#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:28,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {5900#(and (= |ldv_zalloc_#in~size#1| (select |#length| |ldv_zalloc_#t~malloc13#1.base|)) (= (select |#valid| |ldv_zalloc_#t~malloc13#1.base|) (_ bv1 1)) (= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:28,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} assume true; {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:51:28,163 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5904#(and (= (select |#length| |ldv_zalloc_#res#1.base|) |ldv_zalloc_#in~size#1|) (= |ldv_zalloc_#res#1.offset| (_ bv0 32)) (= (select |#valid| |ldv_zalloc_#res#1.base|) (_ bv1 1)))} {5886#true} #188#return; {5911#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv12 32)) (= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:28,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {5911#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret53#1.base|) (_ bv12 32)) (= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32)))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,165 INFO L272 TraceCheckUtils]: 9: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:51:28,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} is VALID [2022-02-20 23:51:28,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} is VALID [2022-02-20 23:51:28,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} assume true; {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} is VALID [2022-02-20 23:51:28,170 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5926#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_165 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_165))) (exists ((v_ArrVal_164 (_ BitVec 1))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_164) |#valid|))))} {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} #190#return; {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,172 INFO L272 TraceCheckUtils]: 16: Hoare triple {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:51:28,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {5922#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} is VALID [2022-02-20 23:51:28,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} is VALID [2022-02-20 23:51:28,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} assume true; {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} is VALID [2022-02-20 23:51:28,177 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5948#(exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (exists ((v_ArrVal_166 (_ BitVec 32))) (= (store |old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_166) |#length|))))} {5915#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} #192#return; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:51:28,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {5958#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset)), #length[entry_point_~hdev~0#1.base]) && ~bvule32(~bvadd32(8bv32, entry_point_~hdev~0#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset))); {5887#false} is VALID [2022-02-20 23:51:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:51:28,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:30,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [901787027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:51:30,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:30,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-02-20 23:51:30,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889040029] [2022-02-20 23:51:30,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 23:51:30,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:30,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:30,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:30,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:51:30,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:51:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=105, Unknown=1, NotChecked=0, Total=132 [2022-02-20 23:51:30,513 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:32,319 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-02-20 23:51:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 23:51:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2022-02-20 23:51:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2022-02-20 23:51:32,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 190 transitions. [2022-02-20 23:51:32,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:32,510 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:51:32,510 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:51:32,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-02-20 23:51:32,511 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 138 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:32,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 441 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 348 Invalid, 0 Unknown, 60 Unchecked, 0.6s Time] [2022-02-20 23:51:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:51:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 155. [2022-02-20 23:51:32,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:32,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 155 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:32,515 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 155 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:32,515 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 155 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:32,519 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-02-20 23:51:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 194 transitions. [2022-02-20 23:51:32,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:32,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:32,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 185 states. [2022-02-20 23:51:32,520 INFO L87 Difference]: Start difference. First operand has 155 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 185 states. [2022-02-20 23:51:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:32,524 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-02-20 23:51:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 194 transitions. [2022-02-20 23:51:32,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:32,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:32,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:32,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 147 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2022-02-20 23:51:32,527 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 29 [2022-02-20 23:51:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:32,528 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2022-02-20 23:51:32,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-02-20 23:51:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:51:32,529 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:32,529 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:32,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:32,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:32,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:32,939 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1039070521, now seen corresponding path program 1 times [2022-02-20 23:51:32,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:32,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251960244] [2022-02-20 23:51:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:32,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:32,942 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:32,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:51:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:33,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:51:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:33,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:33,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {6836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {6836#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L272 TraceCheckUtils]: 2: Hoare triple {6836#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {6836#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {6836#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {6836#true} assume true; {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6836#true} {6836#true} #188#return; {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {6836#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {6836#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L272 TraceCheckUtils]: 9: Hoare triple {6836#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {6836#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {6836#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {6836#true} assume true; {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6836#true} {6836#true} #190#return; {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {6836#true} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {6836#true} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L272 TraceCheckUtils]: 16: Hoare triple {6836#true} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {6836#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {6836#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {6836#true} assume true; {6836#true} is VALID [2022-02-20 23:51:33,120 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6836#true} {6836#true} #192#return; {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {6836#true} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {6836#true} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {6836#true} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {6836#true} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {6836#true} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {6836#true} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {6836#true} is VALID [2022-02-20 23:51:33,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {6836#true} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {6836#true} is VALID [2022-02-20 23:51:33,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {6836#true} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {6925#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:33,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {6925#(= (select |#valid| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {6929#(= (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:33,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {6929#(= (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[ldv_arvo_init_specials_unsafe_~hdev#1.base]); {6837#false} is VALID [2022-02-20 23:51:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 23:51:33,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:33,123 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:33,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251960244] [2022-02-20 23:51:33,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251960244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:33,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:33,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:51:33,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234150182] [2022-02-20 23:51:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:33,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-20 23:51:33,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:33,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:33,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:33,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:33,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:33,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:33,152 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:33,638 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2022-02-20 23:51:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-20 23:51:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-02-20 23:51:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-02-20 23:51:33,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-02-20 23:51:33,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:33,780 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:51:33,780 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:51:33,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:33,781 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 109 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:33,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 238 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:51:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-02-20 23:51:33,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:33,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 154 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:33,785 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 154 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:33,786 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 154 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:33,789 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2022-02-20 23:51:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2022-02-20 23:51:33,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:33,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:33,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:51:33,790 INFO L87 Difference]: Start difference. First operand has 154 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 171 states. [2022-02-20 23:51:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:33,793 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2022-02-20 23:51:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2022-02-20 23:51:33,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:33,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:33,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:33,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 146 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2022-02-20 23:51:33,797 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 31 [2022-02-20 23:51:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:33,797 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2022-02-20 23:51:33,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2022-02-20 23:51:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:51:33,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:33,798 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:33,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:34,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:34,007 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1039070520, now seen corresponding path program 1 times [2022-02-20 23:51:34,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:34,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945775698] [2022-02-20 23:51:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:34,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:34,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:34,009 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:51:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:34,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:51:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:34,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:34,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {7601#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {7601#true} is VALID [2022-02-20 23:51:34,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {7601#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {7601#true} is VALID [2022-02-20 23:51:34,246 INFO L272 TraceCheckUtils]: 2: Hoare triple {7601#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {7601#true} is VALID [2022-02-20 23:51:34,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {7601#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {7615#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {7615#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {7619#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {7619#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} assume true; {7619#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,248 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7619#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} {7601#true} #188#return; {7626#(= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {7626#(= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,248 INFO L272 TraceCheckUtils]: 9: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {7601#true} is VALID [2022-02-20 23:51:34,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {7601#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {7601#true} is VALID [2022-02-20 23:51:34,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {7601#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {7601#true} is VALID [2022-02-20 23:51:34,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {7601#true} assume true; {7601#true} is VALID [2022-02-20 23:51:34,249 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7601#true} {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} #190#return; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,250 INFO L272 TraceCheckUtils]: 16: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {7601#true} is VALID [2022-02-20 23:51:34,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {7601#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {7601#true} is VALID [2022-02-20 23:51:34,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {7601#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {7601#true} is VALID [2022-02-20 23:51:34,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {7601#true} assume true; {7601#true} is VALID [2022-02-20 23:51:34,250 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7601#true} {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} #192#return; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:34,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {7630#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {7694#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|)))} is VALID [2022-02-20 23:51:34,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {7694#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (bvule (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|)))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {7698#(and (bvule (_ bv12 32) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|)) (= |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:34,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {7698#(and (bvule (_ bv12 32) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|)) (= |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset)), #length[ldv_arvo_init_specials_unsafe_~hdev#1.base]) && ~bvule32(~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset))); {7602#false} is VALID [2022-02-20 23:51:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:34,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:34,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-02-20 23:51:34,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {7702#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|) (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv12 32))) (bvule (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset)), #length[ldv_arvo_init_specials_unsafe_~hdev#1.base]) && ~bvule32(~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset))); {7602#false} is VALID [2022-02-20 23:51:34,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {7706#(and (bvule (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32))))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {7702#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|) (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv12 32))) (bvule (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|)))} is VALID [2022-02-20 23:51:34,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {7706#(and (bvule (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32))))} is VALID [2022-02-20 23:51:34,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,613 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7601#true} {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} #192#return; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {7601#true} assume true; {7601#true} is VALID [2022-02-20 23:51:34,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {7601#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {7601#true} is VALID [2022-02-20 23:51:34,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {7601#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {7601#true} is VALID [2022-02-20 23:51:34,613 INFO L272 TraceCheckUtils]: 16: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {7601#true} is VALID [2022-02-20 23:51:34,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,615 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7601#true} {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} #190#return; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {7601#true} assume true; {7601#true} is VALID [2022-02-20 23:51:34,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {7601#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {7601#true} is VALID [2022-02-20 23:51:34,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {7601#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {7601#true} is VALID [2022-02-20 23:51:34,616 INFO L272 TraceCheckUtils]: 9: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {7601#true} is VALID [2022-02-20 23:51:34,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret53#1.offset|) (bvadd |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv12 32)))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {7710#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,617 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7781#(bvule (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|) (bvadd |ldv_zalloc_#res#1.offset| (_ bv12 32)))} {7601#true} #188#return; {7774#(bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret53#1.offset|) (bvadd |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {7781#(bvule (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|) (bvadd |ldv_zalloc_#res#1.offset| (_ bv12 32)))} assume true; {7781#(bvule (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|) (bvadd |ldv_zalloc_#res#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {7788#(bvule (bvadd |ldv_zalloc_#t~malloc13#1.offset| (_ bv8 32)) (bvadd |ldv_zalloc_#t~malloc13#1.offset| (_ bv12 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {7781#(bvule (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|) (bvadd |ldv_zalloc_#res#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {7601#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {7788#(bvule (bvadd |ldv_zalloc_#t~malloc13#1.offset| (_ bv8 32)) (bvadd |ldv_zalloc_#t~malloc13#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:51:34,618 INFO L272 TraceCheckUtils]: 2: Hoare triple {7601#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {7601#true} is VALID [2022-02-20 23:51:34,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {7601#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {7601#true} is VALID [2022-02-20 23:51:34,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {7601#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {7601#true} is VALID [2022-02-20 23:51:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:34,619 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:34,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945775698] [2022-02-20 23:51:34,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945775698] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:34,619 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:34,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-02-20 23:51:34,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044353081] [2022-02-20 23:51:34,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2022-02-20 23:51:34,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:34,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:34,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:34,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:51:34,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:51:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:51:34,687 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:37,065 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2022-02-20 23:51:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2022-02-20 23:51:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2022-02-20 23:51:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2022-02-20 23:51:37,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 178 transitions. [2022-02-20 23:51:37,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:37,244 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:51:37,244 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:51:37,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:51:37,245 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 442 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:37,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 717 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:51:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:51:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 149. [2022-02-20 23:51:37,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:37,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 149 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:37,248 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 149 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:37,249 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 149 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:37,252 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2022-02-20 23:51:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2022-02-20 23:51:37,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:37,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:37,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 176 states. [2022-02-20 23:51:37,253 INFO L87 Difference]: Start difference. First operand has 149 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 176 states. [2022-02-20 23:51:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:37,256 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2022-02-20 23:51:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2022-02-20 23:51:37,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:37,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:37,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:37,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 141 states have internal predecessors, (166), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2022-02-20 23:51:37,260 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 31 [2022-02-20 23:51:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:37,260 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2022-02-20 23:51:37,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:51:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2022-02-20 23:51:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:51:37,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:37,261 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:37,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:37,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:37,467 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2114357432, now seen corresponding path program 1 times [2022-02-20 23:51:37,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:37,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511356479] [2022-02-20 23:51:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:37,469 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:37,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:51:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:37,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:51:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:37,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:37,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:37,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:51:37,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {8478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {8478#true} is VALID [2022-02-20 23:51:37,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {8478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {8478#true} is VALID [2022-02-20 23:51:37,844 INFO L272 TraceCheckUtils]: 2: Hoare triple {8478#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {8478#true} is VALID [2022-02-20 23:51:37,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {8478#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {8492#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {8492#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} assume true; {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,846 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} {8478#true} #188#return; {8503#(= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {8503#(= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,847 INFO L272 TraceCheckUtils]: 9: Hoare triple {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {8478#true} is VALID [2022-02-20 23:51:37,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {8478#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {8492#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {8492#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} assume true; {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,849 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8496#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} #190#return; {8526#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:37,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {8526#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,850 INFO L272 TraceCheckUtils]: 16: Hoare triple {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {8478#true} is VALID [2022-02-20 23:51:37,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {8478#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {8478#true} is VALID [2022-02-20 23:51:37,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {8478#true} is VALID [2022-02-20 23:51:37,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {8478#true} assume true; {8478#true} is VALID [2022-02-20 23:51:37,851 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8478#true} {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} #192#return; {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:37,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {8507#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:37,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {8551#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {8573#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:51:37,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {8573#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))) (_ bv1 1)))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {8577#(and (= |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv0 32)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv8 32))) (_ bv1 1)))} is VALID [2022-02-20 23:51:37,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {8577#(and (= |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv0 32)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv8 32))) (_ bv1 1)))} SUMMARY for call ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset := read~$Pointer$(ldv_arvo_init_specials_unsafe_~hdev#1.base, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset), 4bv32); srcloc: L780 {8581#(= (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:37,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {8581#(= (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|) (_ bv1 1))} ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset := ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset := ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ~bvsub32(ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, 8bv32); {8585#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|))} is VALID [2022-02-20 23:51:37,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {8585#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|))} assume !(1bv1 == #valid[ldv_arvo_init_specials_unsafe_~intf~0#1.base]); {8479#false} is VALID [2022-02-20 23:51:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:37,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:38,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {8585#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|))} assume !(1bv1 == #valid[ldv_arvo_init_specials_unsafe_~intf~0#1.base]); {8479#false} is VALID [2022-02-20 23:51:38,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {8581#(= (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|) (_ bv1 1))} ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset := ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset := ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ~bvsub32(ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, 8bv32); {8585#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|))} is VALID [2022-02-20 23:51:38,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {8595#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|))) (_ bv1 1))} SUMMARY for call ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset := read~$Pointer$(ldv_arvo_init_specials_unsafe_~hdev#1.base, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset), 4bv32); srcloc: L780 {8581#(= (select |#valid| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:38,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {8599#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))) (_ bv1 1))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {8595#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:51:38,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {8599#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:51:38,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {8478#true} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {8603#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_~intf~2#1.base|))} is VALID [2022-02-20 23:51:38,081 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8478#true} {8478#true} #192#return; {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {8478#true} assume true; {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {8478#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L272 TraceCheckUtils]: 16: Hoare triple {8478#true} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {8478#true} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {8478#true} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {8478#true} is VALID [2022-02-20 23:51:38,081 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8478#true} {8478#true} #190#return; {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {8478#true} assume true; {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {8478#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {8478#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L272 TraceCheckUtils]: 9: Hoare triple {8478#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {8478#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {8478#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8478#true} {8478#true} #188#return; {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {8478#true} assume true; {8478#true} is VALID [2022-02-20 23:51:38,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {8478#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {8478#true} is VALID [2022-02-20 23:51:38,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {8478#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {8478#true} is VALID [2022-02-20 23:51:38,083 INFO L272 TraceCheckUtils]: 2: Hoare triple {8478#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {8478#true} is VALID [2022-02-20 23:51:38,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {8478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {8478#true} is VALID [2022-02-20 23:51:38,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {8478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {8478#true} is VALID [2022-02-20 23:51:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 23:51:38,083 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:38,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511356479] [2022-02-20 23:51:38,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511356479] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 23:51:38,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:51:38,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2022-02-20 23:51:38,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597516979] [2022-02-20 23:51:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:38,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 23:51:38,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:38,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:38,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:38,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:38,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:51:38,128 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,512 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:51:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-02-20 23:51:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2022-02-20 23:51:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2022-02-20 23:51:39,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 163 transitions. [2022-02-20 23:51:39,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:39,676 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:51:39,676 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:51:39,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:51:39,677 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 127 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:39,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 437 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:51:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:51:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-02-20 23:51:39,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:39,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 140 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:39,681 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 140 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:39,681 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 140 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,684 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:51:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:51:39,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:39,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:39,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 140 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 165 states. [2022-02-20 23:51:39,685 INFO L87 Difference]: Start difference. First operand has 148 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 140 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 165 states. [2022-02-20 23:51:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,688 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:51:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:51:39,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:39,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:39,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:39,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 140 states have internal predecessors, (165), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2022-02-20 23:51:39,694 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 33 [2022-02-20 23:51:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:39,694 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2022-02-20 23:51:39,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:51:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2022-02-20 23:51:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:51:39,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:39,695 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:39,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:39,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:39,905 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2114357431, now seen corresponding path program 1 times [2022-02-20 23:51:39,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:39,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073028244] [2022-02-20 23:51:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:39,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:39,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:39,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:39,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:51:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:40,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 23:51:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:40,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:40,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:40,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:40,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:51:40,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:51:40,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {9340#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {9340#true} is VALID [2022-02-20 23:51:40,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {9340#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {9340#true} is VALID [2022-02-20 23:51:40,407 INFO L272 TraceCheckUtils]: 2: Hoare triple {9340#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {9340#true} is VALID [2022-02-20 23:51:40,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {9340#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {9354#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {9354#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} assume true; {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,409 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} {9340#true} #188#return; {9365#(= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {9365#(= |ULTIMATE.start_entry_point_#t~ret53#1.offset| (_ bv0 32))} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {9369#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {9369#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {9369#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,410 INFO L272 TraceCheckUtils]: 9: Hoare triple {9369#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {9340#true} is VALID [2022-02-20 23:51:40,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {9340#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {9354#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {9354#(= |ldv_zalloc_#t~malloc13#1.offset| (_ bv0 32))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} assume true; {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:40,412 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9358#(= |ldv_zalloc_#res#1.offset| (_ bv0 32))} {9369#(= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32))} #190#return; {9388#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {9388#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret54#1.offset| (_ bv0 32)))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,413 INFO L272 TraceCheckUtils]: 16: Hoare triple {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {9340#true} is VALID [2022-02-20 23:51:40,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {9340#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {9340#true} is VALID [2022-02-20 23:51:40,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {9340#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {9340#true} is VALID [2022-02-20 23:51:40,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {9340#true} assume true; {9340#true} is VALID [2022-02-20 23:51:40,414 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9340#true} {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} #192#return; {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:40,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {9392#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:40,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {9414#(and (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {9436#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|)))) (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))))} is VALID [2022-02-20 23:51:40,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {9436#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|)))) (= |ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {9440#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv8 32)))) (= |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv8 32)) (_ bv8 32)))} is VALID [2022-02-20 23:51:40,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {9440#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv8 32)))) (= |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (_ bv8 32)) (_ bv8 32)))} SUMMARY for call ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset := read~$Pointer$(ldv_arvo_init_specials_unsafe_~hdev#1.base, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset), 4bv32); srcloc: L780 {9444#(and (= (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset|) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|)))} is VALID [2022-02-20 23:51:40,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {9444#(and (= (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset|) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|)))} ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset := ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset := ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ~bvsub32(ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, 8bv32); {9448#(and (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|)) (= (_ bv8 32) (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:51:40,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {9448#(and (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|)) (= (_ bv8 32) (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv8 32))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset)), #length[ldv_arvo_init_specials_unsafe_~intf~0#1.base]) && ~bvule32(~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset))); {9341#false} is VALID [2022-02-20 23:51:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:40,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:40,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-02-20 23:51:41,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {9452#(and (bvule (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv8 32))) (bvule (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset)), #length[ldv_arvo_init_specials_unsafe_~intf~0#1.base]) && ~bvule32(~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ldv_arvo_init_specials_unsafe_~intf~0#1.offset))); {9341#false} is VALID [2022-02-20 23:51:41,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {9456#(and (bvule |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset| (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|)) (bvule (bvadd (_ bv4294967292 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset|) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset|))} ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset := ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset;ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset := ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ~bvsub32(ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, 8bv32); {9452#(and (bvule (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv8 32))) (bvule (bvadd |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~intf~0#1.base|)))} is VALID [2022-02-20 23:51:41,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {9460#(and (bvule (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|)))))} SUMMARY for call ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset := read~$Pointer$(ldv_arvo_init_specials_unsafe_~hdev#1.base, ~bvadd32(8bv32, ldv_arvo_init_specials_unsafe_~hdev#1.offset), 4bv32); srcloc: L780 {9456#(and (bvule |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset| (select |#length| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.base|)) (bvule (bvadd (_ bv4294967292 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset|) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_#t~mem43#1.offset|))} is VALID [2022-02-20 23:51:41,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {9464#(and (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|)))) (bvule (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))))} assume { :begin_inline_ldv_arvo_probe_unsafe } true;ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset := entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset;havoc ldv_arvo_probe_unsafe_#res#1;havoc ldv_arvo_probe_unsafe_#t~ret52#1, ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset, ldv_arvo_probe_unsafe_~retval~1#1;ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset := ldv_arvo_probe_unsafe_#in~hdev#1.base, ldv_arvo_probe_unsafe_#in~hdev#1.offset;havoc ldv_arvo_probe_unsafe_~retval~1#1;assume { :begin_inline_ldv_arvo_init_specials_unsafe } true;ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset := ldv_arvo_probe_unsafe_~hdev#1.base, ldv_arvo_probe_unsafe_~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_#res#1;havoc ldv_arvo_init_specials_unsafe_#t~mem43#1.base, ldv_arvo_init_specials_unsafe_#t~mem43#1.offset, ldv_arvo_init_specials_unsafe_~__mptr~4#1.base, ldv_arvo_init_specials_unsafe_~__mptr~4#1.offset, ldv_arvo_init_specials_unsafe_#t~mem44#1.base, ldv_arvo_init_specials_unsafe_#t~mem44#1.offset, ldv_arvo_init_specials_unsafe_#t~mem45#1, ldv_arvo_init_specials_unsafe_#t~ret46#1.base, ldv_arvo_init_specials_unsafe_#t~ret46#1.offset, ldv_arvo_init_specials_unsafe_#t~ret47#1, ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset, ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset, ldv_arvo_init_specials_unsafe_~retval~0#1, ldv_arvo_init_specials_unsafe_~intf~0#1.base, ldv_arvo_init_specials_unsafe_~intf~0#1.offset;ldv_arvo_init_specials_unsafe_~hdev#1.base, ldv_arvo_init_specials_unsafe_~hdev#1.offset := ldv_arvo_init_specials_unsafe_#in~hdev#1.base, ldv_arvo_init_specials_unsafe_#in~hdev#1.offset;havoc ldv_arvo_init_specials_unsafe_~arvo~0#1.base, ldv_arvo_init_specials_unsafe_~arvo~0#1.offset;havoc ldv_arvo_init_specials_unsafe_~retval~0#1; {9460#(and (bvule (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_ldv_arvo_init_specials_unsafe_~hdev#1.offset|)))))} is VALID [2022-02-20 23:51:41,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call write~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(8bv32, entry_point_~intf~2#1.offset), entry_point_~hdev~0#1.base, ~bvadd32(8bv32, entry_point_~hdev~0#1.offset), 4bv32); srcloc: L828 {9464#(and (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|)))) (bvule (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~hdev~0#1.offset|))))} is VALID [2022-02-20 23:51:41,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} havoc entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset;havoc entry_point_#t~nondet58#1; {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call write~intINTTYPE1(entry_point_#t~nondet58#1[8:0], entry_point_#t~mem57#1.base, ~bvadd32(7bv32, entry_point_#t~mem57#1.offset), 1bv32); srcloc: L827-1 {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L827 {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} assume !(entry_point_#t~mem56#1.base == 0bv32 && entry_point_#t~mem56#1.offset == 0bv32);havoc entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset; {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} SUMMARY for call entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset := read~$Pointer$(entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L826 {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} havoc entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset; {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} SUMMARY for call write~$Pointer$(entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_~intf~2#1.base, ~bvadd32(4bv32, entry_point_~intf~2#1.offset), 4bv32); srcloc: L825-1 {9468#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (select |#length| |ULTIMATE.start_entry_point_~intf~2#1.base|)))} is VALID [2022-02-20 23:51:41,193 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9340#true} {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} #192#return; {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} is VALID [2022-02-20 23:51:41,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {9340#true} assume true; {9340#true} is VALID [2022-02-20 23:51:41,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {9340#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {9340#true} is VALID [2022-02-20 23:51:41,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {9340#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {9340#true} is VALID [2022-02-20 23:51:41,193 INFO L272 TraceCheckUtils]: 16: Hoare triple {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} call entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset := ldv_zalloc(9bv32); {9340#true} is VALID [2022-02-20 23:51:41,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} assume !(entry_point_~intf~2#1.base == 0bv32 && entry_point_~intf~2#1.offset == 0bv32); {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} is VALID [2022-02-20 23:51:41,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {9512#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_#t~ret54#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret54#1.offset|))} entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset := entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset;havoc entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset; {9490#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~intf~2#1.offset|))} is VALID [2022-02-20 23:51:41,195 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9519#(bvule (bvadd (_ bv4 32) |ldv_zalloc_#res#1.offset|) (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|))} {9340#true} #190#return; {9512#(bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_#t~ret54#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret54#1.offset|))} is VALID [2022-02-20 23:51:41,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {9519#(bvule (bvadd (_ bv4 32) |ldv_zalloc_#res#1.offset|) (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|))} assume true; {9519#(bvule (bvadd (_ bv4 32) |ldv_zalloc_#res#1.offset|) (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|))} is VALID [2022-02-20 23:51:41,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#(bvule (bvadd (_ bv4 32) |ldv_zalloc_#t~malloc13#1.offset|) (bvadd |ldv_zalloc_#t~malloc13#1.offset| (_ bv8 32)))} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {9519#(bvule (bvadd (_ bv4 32) |ldv_zalloc_#res#1.offset|) (bvadd (_ bv8 32) |ldv_zalloc_#res#1.offset|))} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {9340#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {9526#(bvule (bvadd (_ bv4 32) |ldv_zalloc_#t~malloc13#1.offset|) (bvadd |ldv_zalloc_#t~malloc13#1.offset| (_ bv8 32)))} is VALID [2022-02-20 23:51:41,196 INFO L272 TraceCheckUtils]: 9: Hoare triple {9340#true} call entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset := ldv_zalloc(20bv32); {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {9340#true} assume !(entry_point_~hdev~0#1.base == 0bv32 && entry_point_~hdev~0#1.offset == 0bv32); {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {9340#true} entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset := entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset; {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9340#true} {9340#true} #188#return; {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {9340#true} assume true; {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {9340#true} assume { :end_inline_#Ultimate.meminit } true;#res#1.base, #res#1.offset := #t~malloc13#1.base, #t~malloc13#1.offset; {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {9340#true} ~size#1 := #in~size#1;call #t~malloc13#1.base, #t~malloc13#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc13#1.base, #t~malloc13#1.offset, ~size#1, 1bv32, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L272 TraceCheckUtils]: 2: Hoare triple {9340#true} call entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset := ldv_zalloc(12bv32); {9340#true} is VALID [2022-02-20 23:51:41,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {9340#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret53#1.base, entry_point_#t~ret53#1.offset, entry_point_#t~ret54#1.base, entry_point_#t~ret54#1.offset, entry_point_#t~ret55#1.base, entry_point_#t~ret55#1.offset, entry_point_#t~mem56#1.base, entry_point_#t~mem56#1.offset, entry_point_#t~mem57#1.base, entry_point_#t~mem57#1.offset, entry_point_#t~nondet58#1, entry_point_#t~ret59#1, entry_point_#t~mem60#1.base, entry_point_#t~mem60#1.offset, entry_point_~hdev~0#1.base, entry_point_~hdev~0#1.offset, entry_point_~intf~2#1.base, entry_point_~intf~2#1.offset; {9340#true} is VALID [2022-02-20 23:51:41,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {9340#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {9340#true} is VALID [2022-02-20 23:51:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:51:41,197 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:41,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073028244] [2022-02-20 23:51:41,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073028244] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:41,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:41,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2022-02-20 23:51:41,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267123027] [2022-02-20 23:51:41,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2022-02-20 23:51:41,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:41,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:51:41,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:41,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 23:51:41,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 23:51:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:51:41,296 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:51:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:45,964 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-02-20 23:51:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:51:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2022-02-20 23:51:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:51:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 175 transitions. [2022-02-20 23:51:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:51:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 175 transitions. [2022-02-20 23:51:45,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 175 transitions. [2022-02-20 23:51:46,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:46,222 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:51:46,222 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:51:46,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:51:46,223 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 370 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:46,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 1087 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 23:51:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:51:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2022-02-20 23:51:46,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:46,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 142 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 134 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:46,227 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 142 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 134 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:46,227 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 142 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 134 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:46,230 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-02-20 23:51:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-02-20 23:51:46,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:46,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:46,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 134 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 173 states. [2022-02-20 23:51:46,231 INFO L87 Difference]: Start difference. First operand has 142 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 134 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 173 states. [2022-02-20 23:51:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:46,234 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-02-20 23:51:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-02-20 23:51:46,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:46,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:46,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:46,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 134 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:51:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2022-02-20 23:51:46,238 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 33 [2022-02-20 23:51:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:46,238 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2022-02-20 23:51:46,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:51:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2022-02-20 23:51:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:51:46,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:46,239 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:46,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:46,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:46,454 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2022-02-20 23:51:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1120570930, now seen corresponding path program 1 times [2022-02-20 23:51:46,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:46,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383287951] [2022-02-20 23:51:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:46,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:46,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:46,456 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:51:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:46,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-20 23:51:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:46,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:46,641 INFO L390 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 [2022-02-20 23:51:46,857 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:51:46,858 INFO L390 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 17 treesize of output 24 [2022-02-20 23:51:47,104 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-02-20 23:51:47,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 40 [2022-02-20 23:51:47,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:51:47,533 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:51:47,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-02-20 23:51:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9