./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0019_1-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/list-ext-properties/test-0019_1-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 e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:16,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:16,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:16,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:16,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:16,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:16,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:16,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:16,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:16,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:16,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:16,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:16,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:16,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:16,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:16,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:16,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:16,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:16,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:16,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:16,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:16,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:16,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:16,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:16,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:16,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:16,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:16,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:16,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:16,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:16,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:16,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:16,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:16,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:16,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:16,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:16,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:16,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:16,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:16,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:16,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:16,664 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:48:16,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:16,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:16,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:16,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:16,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:16,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:16,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:16,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:16,689 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:16,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:16,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:16,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:16,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:16,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:16,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:16,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:16,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:16,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:16,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:16,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:16,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:16,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:16,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:16,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:16,693 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 -> e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 [2022-02-20 23:48:16,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:16,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:16,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:16,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:16,907 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:16,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2022-02-20 23:48:16,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b3134a1/bfd75d1e5f9649bfa90f2bc4596f4fe6/FLAGa13fc26ab [2022-02-20 23:48:17,342 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:17,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2022-02-20 23:48:17,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b3134a1/bfd75d1e5f9649bfa90f2bc4596f4fe6/FLAGa13fc26ab [2022-02-20 23:48:17,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b3134a1/bfd75d1e5f9649bfa90f2bc4596f4fe6 [2022-02-20 23:48:17,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:17,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:17,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:17,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:17,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:17,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51732077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17, skipping insertion in model container [2022-02-20 23:48:17,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:17,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:17,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:17,623 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:48:17,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7eae166f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17, skipping insertion in model container [2022-02-20 23:48:17,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:17,626 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:48:17,628 INFO L158 Benchmark]: Toolchain (without parser) took 246.97ms. Allocated memory is still 102.8MB. Free memory was 70.5MB in the beginning and 75.0MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:48:17,628 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:17,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.12ms. Allocated memory is still 102.8MB. Free memory was 70.2MB in the beginning and 75.0MB in the end (delta: -4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:48:17,630 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.14ms. Allocated memory is still 102.8MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.12ms. Allocated memory is still 102.8MB. Free memory was 70.2MB in the beginning and 75.0MB in the end (delta: -4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 529]: 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/list-ext-properties/test-0019_1-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 e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:19,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:19,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:19,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:19,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:19,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:19,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:19,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:19,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:19,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:19,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:19,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:19,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:19,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:19,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:19,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:19,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:19,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:19,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:19,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:19,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:19,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:19,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:19,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:19,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:19,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:19,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:19,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:19,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:19,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:19,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:19,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:19,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:19,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:19,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:19,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:19,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:19,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:19,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:19,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:19,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:19,155 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:48:19,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:19,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:19,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:19,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:19,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:19,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:19,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:19,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:19,187 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:19,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:19,188 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:19,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:19,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:19,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:19,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:19,188 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:19,189 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:19,189 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:19,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:19,189 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:19,189 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:48:19,189 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:48:19,190 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:19,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:19,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:19,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:19,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:19,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:19,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:19,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:19,191 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:48:19,191 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:48:19,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:48:19,192 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 -> e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 [2022-02-20 23:48:19,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:19,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:19,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:19,489 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:19,489 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:19,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2022-02-20 23:48:19,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b54e96e/7db158b51c7e4a2982e7f102a074d875/FLAGd4b286033 [2022-02-20 23:48:19,954 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:19,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2022-02-20 23:48:19,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b54e96e/7db158b51c7e4a2982e7f102a074d875/FLAGd4b286033 [2022-02-20 23:48:20,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b54e96e/7db158b51c7e4a2982e7f102a074d875 [2022-02-20 23:48:20,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:20,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:20,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:20,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:20,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:20,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fff5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20, skipping insertion in model container [2022-02-20 23:48:20,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:20,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:20,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:20,562 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:48:20,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:20,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:20,623 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:20,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:20,687 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:20,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20 WrapperNode [2022-02-20 23:48:20,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:20,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:20,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:20,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:20,693 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:48:20" (1/1) ... [2022-02-20 23:48:20,722 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:48:20" (1/1) ... [2022-02-20 23:48:20,737 INFO L137 Inliner]: procedures = 128, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2022-02-20 23:48:20,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:20,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:20,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:20,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:20,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:20,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:20,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:20,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:20,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:20,817 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:48:20,831 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:48:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:48:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:48:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:20,946 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:20,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:21,212 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:21,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:21,217 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:48:21,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:21 BoogieIcfgContainer [2022-02-20 23:48:21,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:21,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:21,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:21,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:21,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:20" (1/3) ... [2022-02-20 23:48:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5262d040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:21, skipping insertion in model container [2022-02-20 23:48:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20" (2/3) ... [2022-02-20 23:48:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5262d040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:21, skipping insertion in model container [2022-02-20 23:48:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:21" (3/3) ... [2022-02-20 23:48:21,225 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2022-02-20 23:48:21,228 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:21,229 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-02-20 23:48:21,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:21,262 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:48:21,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-02-20 23:48:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 31 states have (on average 2.032258064516129) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:21,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:21,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:21,284 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:48:21,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:21,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497882713] [2022-02-20 23:48:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:21,316 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:48:21,317 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:48:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:21,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:48:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:21,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:21,538 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:48:21,540 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-20 23:48:21,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {66#true} is VALID [2022-02-20 23:48:21,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {74#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:21,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {74#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[alloc_data_~pdata#1.base]); {67#false} is VALID [2022-02-20 23:48:21,569 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:48:21,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:21,570 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:21,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497882713] [2022-02-20 23:48:21,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497882713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:21,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:21,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:21,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220166225] [2022-02-20 23:48:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:21,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:21,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:21,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:21,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:21,610 INFO L87 Difference]: Start difference. First operand has 63 states, 31 states have (on average 2.032258064516129) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:21,838 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-02-20 23:48:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 23:48:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 23:48:21,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-02-20 23:48:21,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:21,960 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:48:21,962 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:48:21,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:21,967 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:21,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 38 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:48:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-02-20 23:48:21,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:21,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,994 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,995 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:22,001 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-02-20 23:48:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 23:48:22,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:22,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:22,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 23:48:22,004 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 23:48:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:22,009 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-02-20 23:48:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 23:48:22,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:22,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:22,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:22,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-02-20 23:48:22,018 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 3 [2022-02-20 23:48:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:22,019 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-02-20 23:48:22,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-02-20 23:48:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:22,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:22,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:22,035 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:48:22,231 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:48:22,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:48:22,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:22,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703350762] [2022-02-20 23:48:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:22,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:22,235 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:48:22,248 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:48:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:22,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:48:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:22,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:22,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:22,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:48:22,344 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 11 treesize of output 9 [2022-02-20 23:48:22,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {328#true} is VALID [2022-02-20 23:48:22,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {336#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:22,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), #length[alloc_data_~pdata#1.base]) && ~bvule32(alloc_data_~pdata#1.offset, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))) && ~bvule32(0bv32, alloc_data_~pdata#1.offset)); {329#false} is VALID [2022-02-20 23:48:22,361 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:48:22,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:22,361 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:22,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703350762] [2022-02-20 23:48:22,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703350762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:22,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:22,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:22,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093173323] [2022-02-20 23:48:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:22,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:22,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:22,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:22,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:22,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:22,369 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:22,573 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-02-20 23:48:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:22,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-02-20 23:48:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-02-20 23:48:22,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2022-02-20 23:48:22,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:22,637 INFO L225 Difference]: With dead ends: 56 [2022-02-20 23:48:22,637 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 23:48:22,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:22,638 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:22,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 23:48:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 23:48:22,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:22,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,642 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,642 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:22,643 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-02-20 23:48:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-02-20 23:48:22,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:22,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:22,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2022-02-20 23:48:22,645 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2022-02-20 23:48:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:22,646 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-02-20 23:48:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-02-20 23:48:22,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:22,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:22,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:22,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-02-20 23:48:22,648 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 3 [2022-02-20 23:48:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:22,649 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-02-20 23:48:22,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-02-20 23:48:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:48:22,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:22,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:48:22,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:22,855 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:48:22,856 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-02-20 23:48:22,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:22,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485177433] [2022-02-20 23:48:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:22,859 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:48:22,874 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:48:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:22,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:48:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:22,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:22,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:22,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:48:22,976 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 11 treesize of output 9 [2022-02-20 23:48:23,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:23,041 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:48:23,049 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:23,050 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:48:23,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {563#true} is VALID [2022-02-20 23:48:23,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {571#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:23,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {575#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:23,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {575#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {571#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:23,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {571#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)), #length[alloc_data_~pdata#1.base]) && ~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))); {564#false} is VALID [2022-02-20 23:48:23,066 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:48:23,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:23,066 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:23,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485177433] [2022-02-20 23:48:23,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485177433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:23,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:23,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:23,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32675676] [2022-02-20 23:48:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:48:23,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:23,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:23,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:23,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:23,077 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:23,310 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-02-20 23:48:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:48:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 23:48:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 23:48:23,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-02-20 23:48:23,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:23,378 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:48:23,378 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:48:23,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:23,379 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:23,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 25 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:48:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-02-20 23:48:23,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:23,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,382 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,382 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:23,384 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-02-20 23:48:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-02-20 23:48:23,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:23,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:23,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 23:48:23,385 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 23:48:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:23,386 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-02-20 23:48:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-02-20 23:48:23,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:23,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:23,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:23,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-02-20 23:48:23,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 5 [2022-02-20 23:48:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:23,388 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-02-20 23:48:23,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-02-20 23:48:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:23,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:23,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:23,400 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:48:23,589 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:48:23,590 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 59199982, now seen corresponding path program 1 times [2022-02-20 23:48:23,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:23,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51986917] [2022-02-20 23:48:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:23,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:23,592 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:48:23,593 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:48:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:23,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:48:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:23,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:23,688 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:48:23,688 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:48:23,703 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:48:23,703 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:48:23,763 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 11 treesize of output 7 [2022-02-20 23:48:23,772 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 11 treesize of output 7 [2022-02-20 23:48:23,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:23,823 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 16 treesize of output 18 [2022-02-20 23:48:23,832 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:48:23,832 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 15 treesize of output 15 [2022-02-20 23:48:23,874 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:23,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:48:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:23,890 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 23:48:23,915 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:48:23,918 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:48:23,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {814#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {814#true} is VALID [2022-02-20 23:48:23,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {822#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:23,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {826#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:23,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {826#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {830#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:23,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {830#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {830#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:23,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {830#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:23,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {840#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:23,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_#t~mem5#1.offset), #length[alloc_data_#t~mem5#1.base]) && ~bvule32(alloc_data_#t~mem5#1.offset, ~bvadd32(4bv32, alloc_data_#t~mem5#1.offset))) && ~bvule32(0bv32, alloc_data_#t~mem5#1.offset)); {815#false} is VALID [2022-02-20 23:48:23,942 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:48:23,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:23,942 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:23,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51986917] [2022-02-20 23:48:23,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51986917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:23,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:23,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:23,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727770526] [2022-02-20 23:48:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:23,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:23,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:23,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:23,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:23,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:23,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:23,956 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:24,455 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-20 23:48:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 23:48:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 23:48:24,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-02-20 23:48:24,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:24,509 INFO L225 Difference]: With dead ends: 52 [2022-02-20 23:48:24,509 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 23:48:24,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:24,510 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:24,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 118 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 23:48:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 23:48:24,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:24,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,512 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,512 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:24,513 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-20 23:48:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-20 23:48:24,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:24,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:24,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-20 23:48:24,514 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-20 23:48:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:24,515 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-20 23:48:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-20 23:48:24,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:24,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:24,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:24,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-02-20 23:48:24,517 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 8 [2022-02-20 23:48:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:24,518 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-02-20 23:48:24,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-20 23:48:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:24,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:24,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:24,525 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:48:24,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:24,725 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:24,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash 59199981, now seen corresponding path program 1 times [2022-02-20 23:48:24,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:24,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292759973] [2022-02-20 23:48:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:24,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:24,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:48:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:24,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:48:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:24,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:24,832 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:48:24,833 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:48:24,853 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 11 treesize of output 7 [2022-02-20 23:48:24,882 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:48:24,882 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 23 treesize of output 34 [2022-02-20 23:48:24,945 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:24,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 29 [2022-02-20 23:48:24,993 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:24,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-02-20 23:48:25,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {1055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1055#true} is VALID [2022-02-20 23:48:25,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1063#(= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (_ bv0 1))} is VALID [2022-02-20 23:48:25,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#(= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (_ bv0 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1067#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:25,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {1067#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1071#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:25,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {1071#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:48:25,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {1075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:48:25,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1082#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:48:25,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1082#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[alloc_data_#t~mem5#1.base]); {1056#false} is VALID [2022-02-20 23:48:25,013 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:48:25,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:25,013 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:25,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292759973] [2022-02-20 23:48:25,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292759973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:25,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:25,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:25,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415437548] [2022-02-20 23:48:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:25,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:25,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:25,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:25,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:25,035 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,877 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 23:48:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:48:25,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:48:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-02-20 23:48:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-02-20 23:48:25,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2022-02-20 23:48:25,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,935 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:48:25,936 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:48:25,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:25,936 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:25,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 157 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:48:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 23:48:25,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:25,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,942 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,943 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,944 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 23:48:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 23:48:25,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:48:25,944 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:48:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,946 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 23:48:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 23:48:25,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:25,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-02-20 23:48:25,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 8 [2022-02-20 23:48:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:25,948 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-02-20 23:48:25,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 23:48:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:25,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:25,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:26,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:26,155 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937559, now seen corresponding path program 1 times [2022-02-20 23:48:26,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:26,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544928384] [2022-02-20 23:48:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:26,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:26,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:26,156 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:48:26,158 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:48:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:48:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:26,260 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 11 treesize of output 9 [2022-02-20 23:48:26,288 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 11 treesize of output 7 [2022-02-20 23:48:26,304 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:48:26,336 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:26,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2022-02-20 23:48:26,412 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:26,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-02-20 23:48:26,450 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:26,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 13 [2022-02-20 23:48:26,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1295#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1295#true} is VALID [2022-02-20 23:48:26,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1295#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1303#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|))} is VALID [2022-02-20 23:48:26,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1307#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} is VALID [2022-02-20 23:48:26,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {1307#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1311#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:48:26,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {1311#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:26,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:26,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1322#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} is VALID [2022-02-20 23:48:26,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {1322#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:26,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:26,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {1332#(= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:26,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {1332#(= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[alloc_data_#t~mem6#1.base]); {1296#false} is VALID [2022-02-20 23:48:26,479 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:48:26,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:26,479 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:26,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544928384] [2022-02-20 23:48:26,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544928384] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:26,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:26,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:26,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733689411] [2022-02-20 23:48:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:26,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:26,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:26,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,494 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:48:26,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:26,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:26,495 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,223 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-02-20 23:48:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 23:48:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 23:48:27,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-02-20 23:48:27,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:27,273 INFO L225 Difference]: With dead ends: 50 [2022-02-20 23:48:27,273 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 23:48:27,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:27,274 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:27,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 182 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 23:48:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 23:48:27,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:27,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,276 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,276 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,277 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-02-20 23:48:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-02-20 23:48:27,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:27,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:27,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-20 23:48:27,278 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-20 23:48:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,279 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-02-20 23:48:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-02-20 23:48:27,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:27,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:27,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:27,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-02-20 23:48:27,286 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 11 [2022-02-20 23:48:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:27,286 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-02-20 23:48:27,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-02-20 23:48:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:27,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:27,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:27,296 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:48:27,491 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:48:27,491 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937558, now seen corresponding path program 1 times [2022-02-20 23:48:27,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:27,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375384291] [2022-02-20 23:48:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:27,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:27,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:27,495 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:48:27,495 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:48:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:27,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:48:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:27,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:27,597 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 11 treesize of output 9 [2022-02-20 23:48:27,632 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 11 treesize of output 7 [2022-02-20 23:48:27,655 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:48:27,687 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:48:27,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:27,695 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:48:27,814 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:27,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 23:48:27,820 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 23:48:27,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:48:27,878 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:48:27,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {1541#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1541#true} is VALID [2022-02-20 23:48:27,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1541#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1549#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:48:27,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1549#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1553#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {1553#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1557#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {1557#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1568#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1568#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {1578#(and (= (_ bv0 32) |ULTIMATE.start_alloc_data_#t~mem6#1.offset|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem6#1.base|)))} is VALID [2022-02-20 23:48:27,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {1578#(and (= (_ bv0 32) |ULTIMATE.start_alloc_data_#t~mem6#1.offset|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem6#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_#t~mem6#1.offset), #length[alloc_data_#t~mem6#1.base]) && ~bvule32(alloc_data_#t~mem6#1.offset, ~bvadd32(4bv32, alloc_data_#t~mem6#1.offset))) && ~bvule32(0bv32, alloc_data_#t~mem6#1.offset)); {1542#false} is VALID [2022-02-20 23:48:27,906 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:48:27,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:27,906 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:27,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375384291] [2022-02-20 23:48:27,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375384291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:27,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:27,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:27,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009472554] [2022-02-20 23:48:27,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:27,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:27,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,924 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:48:27,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:27,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:27,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:27,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:27,925 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:28,377 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-02-20 23:48:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:28,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-02-20 23:48:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-02-20 23:48:28,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-02-20 23:48:28,429 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:48:28,430 INFO L225 Difference]: With dead ends: 49 [2022-02-20 23:48:28,430 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 23:48:28,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:28,431 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:28,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 148 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 23:48:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-02-20 23:48:28,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:28,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,433 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,434 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:28,435 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-02-20 23:48:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-02-20 23:48:28,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:28,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:28,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 23:48:28,435 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 23:48:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:28,438 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-02-20 23:48:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-02-20 23:48:28,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:28,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:28,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:28,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-02-20 23:48:28,440 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2022-02-20 23:48:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:28,440 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-02-20 23:48:28,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-02-20 23:48:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:28,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:28,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:28,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:28,647 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:48:28,647 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886990, now seen corresponding path program 1 times [2022-02-20 23:48:28,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:28,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015750127] [2022-02-20 23:48:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:28,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:28,649 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:48:28,650 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:48:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:28,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:48:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:28,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:28,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {1783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1783#true} is VALID [2022-02-20 23:48:28,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:28,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:28,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:28,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:28,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:28,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {1791#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1807#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {1826#(= (select |#valid| |ULTIMATE.start_free_data_~data#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:28,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#(= (select |#valid| |ULTIMATE.start_free_data_~data#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[free_data_~data#1.base]); {1784#false} is VALID [2022-02-20 23:48:28,823 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:48:28,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:28,824 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:28,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015750127] [2022-02-20 23:48:28,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015750127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:28,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:28,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:28,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912419643] [2022-02-20 23:48:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:48:28,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:28,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:28,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:28,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:28,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:28,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:28,840 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,087 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 23:48:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:48:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 23:48:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 23:48:29,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 23:48:29,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,145 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:48:29,145 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:48:29,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:29,145 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:29,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 37 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:48:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-02-20 23:48:29,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:29,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,147 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,147 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,148 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 23:48:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 23:48:29,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:48:29,149 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:48:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,149 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 23:48:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 23:48:29,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:29,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-02-20 23:48:29,150 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 14 [2022-02-20 23:48:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:29,151 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-02-20 23:48:29,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-02-20 23:48:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:29,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:29,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:29,161 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:48:29,359 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:48:29,360 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:29,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886989, now seen corresponding path program 1 times [2022-02-20 23:48:29,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:29,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754450958] [2022-02-20 23:48:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:29,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:29,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:29,361 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:48:29,362 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:48:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:29,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:48:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:29,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:29,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {2035#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2035#true} is VALID [2022-02-20 23:48:29,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2043#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:29,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {2043#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2043#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:29,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {2043#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2043#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:29,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {2043#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:29,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {2053#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {2078#(and (= |ULTIMATE.start_free_data_~data#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~data#1.base|)))} is VALID [2022-02-20 23:48:29,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {2078#(and (= |ULTIMATE.start_free_data_~data#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~data#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, free_data_~data#1.offset), #length[free_data_~data#1.base]) && ~bvule32(free_data_~data#1.offset, ~bvadd32(4bv32, free_data_~data#1.offset))) && ~bvule32(0bv32, free_data_~data#1.offset)); {2036#false} is VALID [2022-02-20 23:48:29,598 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:48:29,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:29,598 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:29,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754450958] [2022-02-20 23:48:29,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754450958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:29,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:29,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:29,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487161040] [2022-02-20 23:48:29,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:48:29,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:29,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:29,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:29,618 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,863 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:29,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:48:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 23:48:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 23:48:29,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-02-20 23:48:29,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,924 INFO L225 Difference]: With dead ends: 43 [2022-02-20 23:48:29,924 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:48:29,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:29,925 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 93 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:29,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 30 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:48:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 23:48:29,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:29,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,927 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,927 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,928 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:29,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 23:48:29,928 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 23:48:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,929 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:29,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:29,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-02-20 23:48:29,930 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 14 [2022-02-20 23:48:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:29,930 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-02-20 23:48:29,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:48:29,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:29,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:29,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:30,131 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:48:30,131 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1959919348, now seen corresponding path program 1 times [2022-02-20 23:48:30,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:30,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478976837] [2022-02-20 23:48:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:30,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:30,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:30,133 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:48:30,134 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:48:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:48:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:30,293 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 11 treesize of output 9 [2022-02-20 23:48:30,338 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 11 treesize of output 7 [2022-02-20 23:48:30,379 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:30,379 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:48:30,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:30,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:48:30,545 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:30,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:48:30,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:30,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 23:48:30,747 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:30,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 17 [2022-02-20 23:48:30,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2257#true} is VALID [2022-02-20 23:48:30,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2265#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:30,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2269#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:30,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {2269#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2273#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)))} is VALID [2022-02-20 23:48:30,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {2273#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2277#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:30,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {2277#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2277#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:30,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {2277#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2284#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:30,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2288#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:30,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {2288#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2288#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:31,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {2288#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2295#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:31,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {2295#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2299#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:31,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {2299#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2299#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:31,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {2299#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {2306#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:31,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {2306#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv1 1)))} SUMMARY for call free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4bv32); srcloc: L536 {2310#(= (select |#valid| |ULTIMATE.start_free_data_#t~mem7#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:31,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {2310#(= (select |#valid| |ULTIMATE.start_free_data_#t~mem7#1.base|) (_ bv1 1))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset; {2314#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:31,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {2314#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} SUMMARY for call free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset := read~$Pointer$(free_data_~data#1.base, ~bvadd32(4bv32, free_data_~data#1.offset), 4bv32); srcloc: L537 {2314#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:31,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {2314#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset;havoc free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset; {2314#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:31,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {2314#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[free_data_~lo~0#1.base]); {2258#false} is VALID [2022-02-20 23:48:31,410 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:48:31,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:31,410 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:31,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478976837] [2022-02-20 23:48:31,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478976837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:31,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:31,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:48:31,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095756467] [2022-02-20 23:48:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:31,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:31,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:31,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:32,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:48:32,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:48:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:48:32,731 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,427 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:48:35,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2022-02-20 23:48:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2022-02-20 23:48:35,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 45 transitions. [2022-02-20 23:48:36,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:36,265 INFO L225 Difference]: With dead ends: 43 [2022-02-20 23:48:36,265 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:48:36,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:48:36,266 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 107 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:36,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 116 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:48:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:48:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-02-20 23:48:36,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:36,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,268 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,268 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,268 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:36,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 23:48:36,269 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 23:48:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,270 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:36,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:36,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-02-20 23:48:36,272 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2022-02-20 23:48:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:36,272 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-02-20 23:48:36,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-02-20 23:48:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:48:36,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:36,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:36,283 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:48:36,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:36,481 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1959919349, now seen corresponding path program 1 times [2022-02-20 23:48:36,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:36,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489648834] [2022-02-20 23:48:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:36,483 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:36,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:48:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:36,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 23:48:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:36,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:36,691 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 11 treesize of output 9 [2022-02-20 23:48:36,741 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 11 treesize of output 7 [2022-02-20 23:48:36,779 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:36,780 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:48:36,821 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 6 treesize of output 5 [2022-02-20 23:48:36,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:36,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:48:36,963 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:36,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-02-20 23:48:36,970 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-02-20 23:48:37,187 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:37,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-02-20 23:48:37,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2022-02-20 23:48:37,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:37,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-02-20 23:48:37,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 16 [2022-02-20 23:48:37,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {2515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2515#true} is VALID [2022-02-20 23:48:37,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {2515#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2523#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:37,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {2523#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2527#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:37,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {2527#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2531#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)))} is VALID [2022-02-20 23:48:37,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {2531#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2535#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:37,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2535#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:37,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {2535#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2542#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~mem5#1.offset|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {2542#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~mem5#1.offset|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2546#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:37,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {2546#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2546#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:38,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {2546#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2553#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:48:38,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2557#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:48:38,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {2557#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2557#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} is VALID [2022-02-20 23:48:38,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {2564#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) (_ bv4 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|))))} is VALID [2022-02-20 23:48:38,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {2564#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) (_ bv4 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) (_ bv4 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|))))} SUMMARY for call free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4bv32); srcloc: L536 {2568#(and (bvule |ULTIMATE.start_free_data_#t~mem7#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|) (select |#length| |ULTIMATE.start_free_data_#t~mem7#1.base|)))} is VALID [2022-02-20 23:48:38,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {2568#(and (bvule |ULTIMATE.start_free_data_#t~mem7#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|) (select |#length| |ULTIMATE.start_free_data_#t~mem7#1.base|)))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset; {2572#(and (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:48:38,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#(and (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} SUMMARY for call free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset := read~$Pointer$(free_data_~data#1.base, ~bvadd32(4bv32, free_data_~data#1.offset), 4bv32); srcloc: L537 {2572#(and (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:48:38,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {2572#(and (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset;havoc free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset; {2572#(and (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:48:38,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#(and (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, free_data_~lo~0#1.offset), #length[free_data_~lo~0#1.base]) && ~bvule32(free_data_~lo~0#1.offset, ~bvadd32(4bv32, free_data_~lo~0#1.offset))) && ~bvule32(0bv32, free_data_~lo~0#1.offset)); {2516#false} is VALID [2022-02-20 23:48:38,090 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:48:38,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:38,090 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:38,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489648834] [2022-02-20 23:48:38,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489648834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:48:38,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578470137] [2022-02-20 23:48:38,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:38,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:48:39,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:39,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:48:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:48:39,528 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,302 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:48:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:48:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 41 transitions. [2022-02-20 23:48:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 41 transitions. [2022-02-20 23:48:44,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 41 transitions. [2022-02-20 23:48:45,537 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:48:45,538 INFO L225 Difference]: With dead ends: 40 [2022-02-20 23:48:45,538 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 23:48:45,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:48:45,538 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 131 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:45,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 96 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 23:48:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 23:48:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 23:48:45,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:45,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,543 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,543 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,544 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:48:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:48:45,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 23:48:45,544 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 23:48:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,545 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 23:48:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:48:45,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:45,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-02-20 23:48:45,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 18 [2022-02-20 23:48:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:45,546 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-02-20 23:48:45,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 23:48:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:48:45,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:45,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:45,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:45,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:45,757 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2022-02-20 23:48:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 627957652, now seen corresponding path program 1 times [2022-02-20 23:48:45,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:45,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262837520] [2022-02-20 23:48:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:45,759 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:48:45,762 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:48:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:45,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 23:48:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:45,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:45,951 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 11 treesize of output 9 [2022-02-20 23:48:45,990 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 11 treesize of output 7 [2022-02-20 23:48:46,037 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:48:46,037 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:48:46,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:46,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:48:46,237 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:46,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 23:48:46,350 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:46,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-02-20 23:48:48,938 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:48,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 17 [2022-02-20 23:48:49,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {2765#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2765#true} is VALID [2022-02-20 23:48:49,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {2765#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2773#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:49,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {2773#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2777#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:49,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {2777#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2781#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {2781#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:49,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:49,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2792#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:49,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:49,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:49,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2802#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {2802#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2806#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {2806#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2806#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {2806#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {2813#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {2813#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))} SUMMARY for call free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4bv32); srcloc: L536 {2813#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2813#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset; {2813#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {2813#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |ULTIMATE.start_free_data_~data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) |ULTIMATE.start_free_data_~data#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))} SUMMARY for call free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset := read~$Pointer$(free_data_~data#1.base, ~bvadd32(4bv32, free_data_~data#1.offset), 4bv32); srcloc: L537 {2823#(and (exists ((|ULTIMATE.start_free_data_~data#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_free_data_#t~mem8#1.base| |ULTIMATE.start_free_data_~data#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))) (= (select |#valid| |ULTIMATE.start_free_data_#t~mem8#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:48:49,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {2823#(and (exists ((|ULTIMATE.start_free_data_~data#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_free_data_#t~mem8#1.base| |ULTIMATE.start_free_data_~data#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)))) (= (select |#valid| |ULTIMATE.start_free_data_#t~mem8#1.base|) (_ bv1 1)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset;havoc free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset; {2827#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)) (exists ((|ULTIMATE.start_free_data_~data#1.base| (_ BitVec 32))) (and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_~data#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} is VALID [2022-02-20 23:48:49,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {2827#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)) (exists ((|ULTIMATE.start_free_data_~data#1.base| (_ BitVec 32))) (and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_~data#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} SUMMARY for call free_data_#t~mem9#1 := read~intINTTYPE4(free_data_~lo~0#1.base, free_data_~lo~0#1.offset, 4bv32); srcloc: L538 {2827#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)) (exists ((|ULTIMATE.start_free_data_~data#1.base| (_ BitVec 32))) (and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_~data#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} is VALID [2022-02-20 23:48:49,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {2827#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|)) (exists ((|ULTIMATE.start_free_data_~data#1.base| (_ BitVec 32))) (and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_~data#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_free_data_~data#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} assume !(1bv1 == #valid[free_data_~hi~0#1.base]); {2766#false} is VALID [2022-02-20 23:48:49,937 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:48:49,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:49,937 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:49,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262837520] [2022-02-20 23:48:49,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262837520] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:49,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:49,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:48:49,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514858933] [2022-02-20 23:48:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:48:49,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:49,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:02,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 13 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:02,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:49:02,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:49:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=104, Unknown=1, NotChecked=0, Total=132 [2022-02-20 23:49:02,102 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)