./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:56:09,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:56:09,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:56:09,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:56:09,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:56:09,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:56:09,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:56:09,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:56:09,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:56:09,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:56:09,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:56:09,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:56:09,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:56:09,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:56:09,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:56:09,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:56:09,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:56:09,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:56:09,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:56:09,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:56:09,127 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:56:09,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:56:09,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:56:09,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:56:09,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:56:09,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:56:09,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:56:09,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:56:09,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:56:09,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:56:09,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:56:09,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:56:09,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:56:09,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:56:09,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:56:09,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:56:09,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:56:09,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:56:09,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:56:09,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:56:09,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:56:09,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:56:09,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:56:09,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:56:09,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:56:09,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:56:09,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:56:09,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:56:09,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:56:09,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:56:09,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:56:09,170 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:56:09,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:56:09,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:56:09,170 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:56:09,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:56:09,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:56:09,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:56:09,171 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:56:09,171 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:56:09,171 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:56:09,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:56:09,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:56:09,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:56:09,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:56:09,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:56:09,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:56:09,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:56:09,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:09,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:56:09,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:56:09,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:56:09,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:56:09,174 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-07-12 18:56:09,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:56:09,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:56:09,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:56:09,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:56:09,415 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:56:09,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-12 18:56:09,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4456f30e9/caebfaafd74d441da42a27cec957308d/FLAG85995740f [2022-07-12 18:56:09,921 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:09,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-12 18:56:09,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4456f30e9/caebfaafd74d441da42a27cec957308d/FLAG85995740f [2022-07-12 18:56:10,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4456f30e9/caebfaafd74d441da42a27cec957308d [2022-07-12 18:56:10,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:10,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:10,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:10,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:10,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:10,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:10" (1/1) ... [2022-07-12 18:56:10,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3d2ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:10, skipping insertion in model container [2022-07-12 18:56:10,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:10" (1/1) ... [2022-07-12 18:56:10,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:10,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:10,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:10,676 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-12 18:56:10,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23ce1844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:10, skipping insertion in model container [2022-07-12 18:56:10,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:10,677 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-12 18:56:10,679 INFO L158 Benchmark]: Toolchain (without parser) took 389.99ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 78.0MB in the beginning and 99.0MB in the end (delta: -21.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-07-12 18:56:10,680 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:56:10,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.56ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 78.0MB in the beginning and 99.0MB in the end (delta: -21.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-07-12 18:56:10,682 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.56ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 78.0MB in the beginning and 99.0MB in the end (delta: -21.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes 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 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:56:12,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:56:12,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:56:12,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:56:12,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:56:12,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:56:12,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:56:12,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:56:12,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:56:12,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:56:12,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:56:12,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:56:12,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:56:12,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:56:12,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:56:12,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:56:12,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:56:12,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:56:12,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:56:12,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:56:12,323 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:56:12,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:56:12,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:56:12,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:56:12,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:56:12,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:56:12,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:56:12,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:56:12,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:56:12,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:56:12,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:56:12,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:56:12,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:56:12,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:56:12,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:56:12,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:56:12,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:56:12,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:56:12,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:56:12,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:56:12,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:56:12,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:56:12,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:56:12,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:56:12,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:56:12,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:56:12,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:56:12,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:56:12,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:56:12,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:56:12,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:56:12,379 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:56:12,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:56:12,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:56:12,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:56:12,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:56:12,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:56:12,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:56:12,390 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:56:12,390 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:56:12,390 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:56:12,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:56:12,390 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:56:12,391 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:56:12,391 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:56:12,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:56:12,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:56:12,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:56:12,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:56:12,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:56:12,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:12,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:56:12,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:56:12,392 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:56:12,393 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:56:12,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:56:12,393 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-07-12 18:56:12,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:56:12,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:56:12,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:56:12,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:56:12,677 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:56:12,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-12 18:56:12,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d8e3ee1/d8021bfa12a2482d88c22bb87b1b77f4/FLAG5c3c3c84c [2022-07-12 18:56:13,165 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:13,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-07-12 18:56:13,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d8e3ee1/d8021bfa12a2482d88c22bb87b1b77f4/FLAG5c3c3c84c [2022-07-12 18:56:13,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d8e3ee1/d8021bfa12a2482d88c22bb87b1b77f4 [2022-07-12 18:56:13,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:13,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:13,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:13,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:13,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:13,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6160d992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13, skipping insertion in model container [2022-07-12 18:56:13,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:13,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:13,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:13,593 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 18:56:13,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:13,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:13,669 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:56:13,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:13,736 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:56:13,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13 WrapperNode [2022-07-12 18:56:13,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:13,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:13,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:56:13,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:56:13,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,786 INFO L137 Inliner]: procedures = 167, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 124 [2022-07-12 18:56:13,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:13,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:56:13,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:56:13,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:56:13,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:56:13,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:56:13,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:56:13,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:56:13,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (1/1) ... [2022-07-12 18:56:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:56:13,875 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-07-12 18:56:13,890 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-07-12 18:56:13,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:56:13,899 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:13,899 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:13,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 18:56:13,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 18:56:13,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-12 18:56:13,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-12 18:56:13,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:56:13,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:56:13,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:56:13,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:56:13,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:56:13,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:56:13,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:56:13,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:56:13,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:56:14,054 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:56:14,056 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:56:14,339 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:56:14,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:56:14,344 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:56:14,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:14 BoogieIcfgContainer [2022-07-12 18:56:14,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:56:14,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:56:14,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:56:14,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:56:14,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:56:13" (1/3) ... [2022-07-12 18:56:14,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564b385f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:14, skipping insertion in model container [2022-07-12 18:56:14,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:13" (2/3) ... [2022-07-12 18:56:14,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564b385f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:14, skipping insertion in model container [2022-07-12 18:56:14,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:14" (3/3) ... [2022-07-12 18:56:14,366 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-07-12 18:56:14,375 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:56:14,375 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-12 18:56:14,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:56:14,404 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@965b558, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6fac7af1 [2022-07-12 18:56:14,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-12 18:56:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:14,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:14,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:14,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:14,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 886333963, now seen corresponding path program 1 times [2022-07-12 18:56:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:14,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016600339] [2022-07-12 18:56:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:14,425 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-07-12 18:56:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:56:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:14,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:14,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:14,522 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-07-12 18:56:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:14,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:14,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016600339] [2022-07-12 18:56:14,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016600339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:14,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:14,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770744522] [2022-07-12 18:56:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:14,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:14,570 INFO L87 Difference]: Start difference. First operand has 92 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:14,813 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2022-07-12 18:56:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-12 18:56:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:14,820 INFO L225 Difference]: With dead ends: 158 [2022-07-12 18:56:14,820 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 18:56:14,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:14,823 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:14,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 387 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:14,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 18:56:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2022-07-12 18:56:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-07-12 18:56:14,849 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2022-07-12 18:56:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:14,850 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-07-12 18:56:14,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-07-12 18:56:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:14,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:14,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:14,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:15,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:15,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash 914963114, now seen corresponding path program 1 times [2022-07-12 18:56:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:15,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301719553] [2022-07-12 18:56:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:15,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:15,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:15,062 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-07-12 18:56:15,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:56:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:15,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:15,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:15,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301719553] [2022-07-12 18:56:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301719553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:15,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:15,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50752666] [2022-07-12 18:56:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:15,144 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:15,175 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-07-12 18:56:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-12 18:56:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:15,181 INFO L225 Difference]: With dead ends: 114 [2022-07-12 18:56:15,181 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 18:56:15,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:15,183 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:15,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 393 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 18:56:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2022-07-12 18:56:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-07-12 18:56:15,189 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2022-07-12 18:56:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:15,189 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-07-12 18:56:15,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-07-12 18:56:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:56:15,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:15,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:15,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:15,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:15,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1706549126, now seen corresponding path program 1 times [2022-07-12 18:56:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:15,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323627560] [2022-07-12 18:56:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:15,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:15,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:15,399 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-07-12 18:56:15,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:56:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:15,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:15,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:15,484 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-07-12 18:56:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:15,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:15,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323627560] [2022-07-12 18:56:15,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323627560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:15,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:15,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839836714] [2022-07-12 18:56:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:15,550 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:15,814 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2022-07-12 18:56:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:15,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-12 18:56:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:15,815 INFO L225 Difference]: With dead ends: 134 [2022-07-12 18:56:15,815 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 18:56:15,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:15,816 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 73 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:15,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 469 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 18:56:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2022-07-12 18:56:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 84 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-12 18:56:15,822 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 11 [2022-07-12 18:56:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:15,822 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-12 18:56:15,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-12 18:56:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:56:15,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:15,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:15,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:16,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1363388625, now seen corresponding path program 1 times [2022-07-12 18:56:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:16,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815486809] [2022-07-12 18:56:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:16,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:16,036 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-07-12 18:56:16,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:56:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:16,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:56:16,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:16,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:16,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815486809] [2022-07-12 18:56:16,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815486809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:16,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:16,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:16,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982753708] [2022-07-12 18:56:16,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:16,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:16,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:16,127 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:16,147 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-07-12 18:56:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-12 18:56:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:16,148 INFO L225 Difference]: With dead ends: 113 [2022-07-12 18:56:16,148 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:56:16,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:16,152 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:16,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 423 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:56:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2022-07-12 18:56:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-12 18:56:16,172 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2022-07-12 18:56:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:16,173 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-12 18:56:16,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-12 18:56:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:56:16,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:16,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:16,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 18:56:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1188768336, now seen corresponding path program 1 times [2022-07-12 18:56:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:16,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200736897] [2022-07-12 18:56:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:16,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:16,394 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-07-12 18:56:16,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:56:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:16,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:16,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:16,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:16,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:16,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200736897] [2022-07-12 18:56:16,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200736897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:16,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:16,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:56:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609172147] [2022-07-12 18:56:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:16,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:16,493 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:16,521 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-07-12 18:56:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-12 18:56:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:16,524 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:56:16,524 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 18:56:16,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:16,526 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 21 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:16,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 288 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 18:56:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2022-07-12 18:56:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-07-12 18:56:16,531 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 12 [2022-07-12 18:56:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:16,531 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-07-12 18:56:16,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-07-12 18:56:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:56:16,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:16,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:16,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:16,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,740 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:16,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 86428473, now seen corresponding path program 1 times [2022-07-12 18:56:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:16,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990058831] [2022-07-12 18:56:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:16,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:16,744 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-07-12 18:56:16,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:56:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:16,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:56:16,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:16,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:16,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:16,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990058831] [2022-07-12 18:56:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990058831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:16,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:16,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:56:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146055756] [2022-07-12 18:56:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:16,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:16,813 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:16,829 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-07-12 18:56:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:56:16,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-12 18:56:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:16,831 INFO L225 Difference]: With dead ends: 104 [2022-07-12 18:56:16,831 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 18:56:16,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-07-12 18:56:16,831 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:16,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 18:56:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2022-07-12 18:56:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.46875) internal successors, (94), 87 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-12 18:56:16,835 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 16 [2022-07-12 18:56:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:16,835 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-12 18:56:16,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-12 18:56:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:56:16,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:16,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:16,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:17,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1674943760, now seen corresponding path program 1 times [2022-07-12 18:56:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:17,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756824907] [2022-07-12 18:56:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:17,045 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-07-12 18:56:17,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:56:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:17,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:56:17,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:17,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:17,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756824907] [2022-07-12 18:56:17,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756824907] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:17,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:17,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:56:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433923942] [2022-07-12 18:56:17,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:17,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:56:17,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:17,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:56:17,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:17,151 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:17,201 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-07-12 18:56:17,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:17,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 18:56:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:17,202 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:56:17,202 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:56:17,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:17,203 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 66 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:17,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:56:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2022-07-12 18:56:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 90 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-07-12 18:56:17,205 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2022-07-12 18:56:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:17,206 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-07-12 18:56:17,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-07-12 18:56:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:56:17,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:17,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:17,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:17,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,414 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1276371002, now seen corresponding path program 1 times [2022-07-12 18:56:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:17,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203147784] [2022-07-12 18:56:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:17,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:17,416 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-07-12 18:56:17,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:56:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:17,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:17,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:17,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:17,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:17,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203147784] [2022-07-12 18:56:17,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203147784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:17,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:17,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432033188] [2022-07-12 18:56:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:17,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:17,545 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:17,610 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-12 18:56:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:56:17,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-12 18:56:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:17,611 INFO L225 Difference]: With dead ends: 113 [2022-07-12 18:56:17,612 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:56:17,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:17,612 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 21 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:17,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 545 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:56:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-12 18:56:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 98 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-07-12 18:56:17,617 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2022-07-12 18:56:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:17,617 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-07-12 18:56:17,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-07-12 18:56:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:56:17,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:17,618 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:17,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:17,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719801, now seen corresponding path program 2 times [2022-07-12 18:56:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:17,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489878449] [2022-07-12 18:56:17,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:17,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:17,831 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-07-12 18:56:17,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:56:17,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:17,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:17,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:56:17,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:17,901 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-07-12 18:56:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 18:56:17,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:17,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489878449] [2022-07-12 18:56:17,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489878449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:17,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:17,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914237221] [2022-07-12 18:56:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:17,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:56:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:56:17,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:17,955 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:18,209 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-12 18:56:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:56:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-12 18:56:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:18,210 INFO L225 Difference]: With dead ends: 142 [2022-07-12 18:56:18,211 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 18:56:18,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:56:18,211 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:18,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 537 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 18:56:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2022-07-12 18:56:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 97 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-07-12 18:56:18,214 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2022-07-12 18:56:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:18,214 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-07-12 18:56:18,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-07-12 18:56:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:56:18,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:18,215 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:18,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 18:56:18,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:18,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719802, now seen corresponding path program 1 times [2022-07-12 18:56:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:18,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893612018] [2022-07-12 18:56:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:18,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:18,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:18,418 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-07-12 18:56:18,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:56:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:18,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:18,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:18,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:18,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:18,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893612018] [2022-07-12 18:56:18,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893612018] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:18,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:18,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-12 18:56:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666275607] [2022-07-12 18:56:18,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:18,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:18,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:18,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:18,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:18,659 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:18,844 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-12 18:56:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-12 18:56:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:18,845 INFO L225 Difference]: With dead ends: 116 [2022-07-12 18:56:18,845 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 18:56:18,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:18,846 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:18,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 782 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 18:56:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-07-12 18:56:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.3625) internal successors, (109), 103 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-07-12 18:56:18,849 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2022-07-12 18:56:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:18,849 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-07-12 18:56:18,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-07-12 18:56:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:56:18,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:18,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:18,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 18:56:19,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:19,057 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1184735654, now seen corresponding path program 1 times [2022-07-12 18:56:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:19,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569133634] [2022-07-12 18:56:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:19,059 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-07-12 18:56:19,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:56:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:19,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:56:19,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:19,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:19,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569133634] [2022-07-12 18:56:19,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569133634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:19,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:19,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:56:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425369357] [2022-07-12 18:56:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:19,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:19,150 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 18:56:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:19,248 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-07-12 18:56:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:56:19,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-12 18:56:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:19,249 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:56:19,249 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 18:56:19,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:19,250 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:19,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 18:56:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-12 18:56:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-07-12 18:56:19,252 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2022-07-12 18:56:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:19,252 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-07-12 18:56:19,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 18:56:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-07-12 18:56:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:56:19,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:19,253 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:19,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-12 18:56:19,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:19,462 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:19,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash -103060070, now seen corresponding path program 2 times [2022-07-12 18:56:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:19,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193174029] [2022-07-12 18:56:19,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:19,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:19,464 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-07-12 18:56:19,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:56:19,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:19,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:19,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:56:19,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:19,533 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-07-12 18:56:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 18:56:19,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:19,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:19,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193174029] [2022-07-12 18:56:19,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193174029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:19,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:19,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790708991] [2022-07-12 18:56:19,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:19,650 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:20,032 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-07-12 18:56:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-12 18:56:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:20,034 INFO L225 Difference]: With dead ends: 141 [2022-07-12 18:56:20,034 INFO L226 Difference]: Without dead ends: 141 [2022-07-12 18:56:20,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:20,035 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:20,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 620 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:56:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-12 18:56:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2022-07-12 18:56:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-07-12 18:56:20,040 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2022-07-12 18:56:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:20,040 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-07-12 18:56:20,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-07-12 18:56:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:56:20,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:20,045 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:20,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:20,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:20,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash -257987495, now seen corresponding path program 1 times [2022-07-12 18:56:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:20,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614919248] [2022-07-12 18:56:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:20,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:20,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:20,264 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:20,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:56:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:20,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:20,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:20,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:20,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:20,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614919248] [2022-07-12 18:56:20,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614919248] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:20,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:20,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-12 18:56:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588873126] [2022-07-12 18:56:20,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:20,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 18:56:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 18:56:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:56:20,911 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:21,240 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-12 18:56:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:56:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-12 18:56:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:21,241 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:56:21,241 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:56:21,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:56:21,242 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:21,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1236 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:56:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 18:56:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.364864864864865) internal successors, (101), 95 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-12 18:56:21,244 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 28 [2022-07-12 18:56:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:21,245 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-12 18:56:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-12 18:56:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:56:21,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:21,245 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:21,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-12 18:56:21,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:21,452 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2039891719, now seen corresponding path program 2 times [2022-07-12 18:56:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449803563] [2022-07-12 18:56:21,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:21,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:21,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:21,454 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:56:21,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:21,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:21,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:21,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:21,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:21,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:21,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449803563] [2022-07-12 18:56:21,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449803563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:21,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:21,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596317148] [2022-07-12 18:56:21,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:21,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:21,565 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:21,607 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-12 18:56:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:56:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-12 18:56:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:21,608 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:56:21,608 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:56:21,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:21,609 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:21,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 371 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:56:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 18:56:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-12 18:56:21,611 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 34 [2022-07-12 18:56:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:21,611 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-12 18:56:21,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-12 18:56:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:21,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:21,612 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:21,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:21,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:21,819 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash -382086172, now seen corresponding path program 1 times [2022-07-12 18:56:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480962020] [2022-07-12 18:56:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:21,822 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:21,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:56:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:21,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:56:21,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:21,955 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-07-12 18:56:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:22,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:22,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:22,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480962020] [2022-07-12 18:56:22,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480962020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:22,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:22,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:22,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009897771] [2022-07-12 18:56:22,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:22,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:22,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:22,027 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:22,227 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-12 18:56:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-12 18:56:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:22,228 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:56:22,228 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:22,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:22,229 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 77 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:22,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 391 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 18:56:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-12 18:56:22,231 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 36 [2022-07-12 18:56:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:22,231 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-12 18:56:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-12 18:56:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:22,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:22,232 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:22,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:22,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:22,432 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -382086171, now seen corresponding path program 1 times [2022-07-12 18:56:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:22,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894084452] [2022-07-12 18:56:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:22,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:22,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:22,434 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:56:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:22,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:56:22,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:22,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:22,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:22,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:22,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894084452] [2022-07-12 18:56:22,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894084452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:22,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:22,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459056206] [2022-07-12 18:56:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:22,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:56:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:56:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:22,807 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:23,047 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-12 18:56:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:56:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-12 18:56:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:23,048 INFO L225 Difference]: With dead ends: 98 [2022-07-12 18:56:23,048 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 18:56:23,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:23,050 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:23,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 472 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 18:56:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 18:56:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-12 18:56:23,053 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2022-07-12 18:56:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:23,054 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-12 18:56:23,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-12 18:56:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:23,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:23,055 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:23,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-12 18:56:23,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:23,255 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash -432796251, now seen corresponding path program 1 times [2022-07-12 18:56:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:23,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67855170] [2022-07-12 18:56:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:23,257 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:23,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:56:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:23,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:23,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:23,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:23,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:23,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67855170] [2022-07-12 18:56:23,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67855170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:23,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896093008] [2022-07-12 18:56:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:23,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:23,485 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:23,517 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-07-12 18:56:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-12 18:56:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:23,518 INFO L225 Difference]: With dead ends: 98 [2022-07-12 18:56:23,518 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 18:56:23,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:23,518 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:23,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 396 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 18:56:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 18:56:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 90 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-12 18:56:23,521 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2022-07-12 18:56:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:23,521 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-12 18:56:23,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-12 18:56:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:56:23,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:23,522 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:23,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:23,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:23,738 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash 74876930, now seen corresponding path program 1 times [2022-07-12 18:56:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:23,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783046852] [2022-07-12 18:56:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:23,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:23,741 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:56:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:23,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:56:23,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:23,912 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-07-12 18:56:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:24,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:24,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:24,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783046852] [2022-07-12 18:56:24,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783046852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:24,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:24,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261095860] [2022-07-12 18:56:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:24,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:24,029 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:24,197 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-12 18:56:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-12 18:56:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:24,198 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:56:24,198 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:24,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:24,199 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 65 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:24,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 347 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-07-12 18:56:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-12 18:56:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-12 18:56:24,201 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 44 [2022-07-12 18:56:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:24,201 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-12 18:56:24,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-12 18:56:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:56:24,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:24,202 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:24,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:24,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:24,408 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 74876931, now seen corresponding path program 1 times [2022-07-12 18:56:24,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:24,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529262669] [2022-07-12 18:56:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:24,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:24,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:24,419 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:24,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:56:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:24,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:56:24,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:24,609 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-07-12 18:56:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:24,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:24,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:24,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529262669] [2022-07-12 18:56:24,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529262669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:24,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:24,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797079669] [2022-07-12 18:56:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:24,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:56:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:56:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:24,780 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:25,029 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-07-12 18:56:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:56:25,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-12 18:56:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:25,033 INFO L225 Difference]: With dead ends: 103 [2022-07-12 18:56:25,033 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 18:56:25,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:25,033 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:25,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 473 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-12 18:56:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 18:56:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2022-07-12 18:56:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-12 18:56:25,036 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2022-07-12 18:56:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:25,036 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-12 18:56:25,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-12 18:56:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:56:25,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:25,036 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:25,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:25,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:25,248 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 496438540, now seen corresponding path program 1 times [2022-07-12 18:56:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:25,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654796780] [2022-07-12 18:56:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:25,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:25,250 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:25,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:56:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:25,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:56:25,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:25,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:25,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:25,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654796780] [2022-07-12 18:56:25,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654796780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:25,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:25,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333198232] [2022-07-12 18:56:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:25,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:25,516 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:25,547 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-12 18:56:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-07-12 18:56:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:25,548 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:56:25,548 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:56:25,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:25,548 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:25,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 394 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:56:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-12 18:56:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 86 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-12 18:56:25,551 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2022-07-12 18:56:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:25,551 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-12 18:56:25,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-12 18:56:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:56:25,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:25,551 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:25,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:25,752 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash -774905870, now seen corresponding path program 1 times [2022-07-12 18:56:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:25,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050647885] [2022-07-12 18:56:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:25,754 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:25,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:56:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:25,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:56:25,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:25,986 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-07-12 18:56:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:26,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:26,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050647885] [2022-07-12 18:56:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050647885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:26,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:26,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627575694] [2022-07-12 18:56:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:26,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:56:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:56:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:26,104 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:26,353 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-07-12 18:56:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-12 18:56:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:26,354 INFO L225 Difference]: With dead ends: 123 [2022-07-12 18:56:26,354 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 18:56:26,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:56:26,355 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:26,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 345 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-12 18:56:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 18:56:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2022-07-12 18:56:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 100 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-07-12 18:56:26,358 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 56 [2022-07-12 18:56:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:26,358 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-07-12 18:56:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-07-12 18:56:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:56:26,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:26,358 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:26,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:26,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:26,569 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash -774905869, now seen corresponding path program 1 times [2022-07-12 18:56:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:26,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889472805] [2022-07-12 18:56:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:26,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:26,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:26,572 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:26,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:56:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:26,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:56:26,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:26,812 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-07-12 18:56:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:27,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:27,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889472805] [2022-07-12 18:56:27,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889472805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:27,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:27,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:56:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559662738] [2022-07-12 18:56:27,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:27,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:27,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:27,127 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:27,497 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-12 18:56:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-12 18:56:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:27,499 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:56:27,499 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 18:56:27,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:27,499 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:27,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 431 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 8 Unchecked, 0.3s Time] [2022-07-12 18:56:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 18:56:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-07-12 18:56:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 98 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-07-12 18:56:27,502 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 56 [2022-07-12 18:56:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:27,502 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-07-12 18:56:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-07-12 18:56:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 18:56:27,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:27,503 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:27,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:27,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:27,712 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -178952659, now seen corresponding path program 1 times [2022-07-12 18:56:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:27,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270828815] [2022-07-12 18:56:27,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:27,715 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:27,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:56:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:27,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:56:27,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:28,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:28,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:28,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270828815] [2022-07-12 18:56:28,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270828815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:28,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:28,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:56:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471809616] [2022-07-12 18:56:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:28,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:56:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:56:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:28,045 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:56:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:28,131 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-07-12 18:56:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:56:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-07-12 18:56:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:28,132 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:56:28,132 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:56:28,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:28,132 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:28,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 514 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:56:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-12 18:56:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 98 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-07-12 18:56:28,134 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 62 [2022-07-12 18:56:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:28,135 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-07-12 18:56:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:56:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-07-12 18:56:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 18:56:28,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:28,135 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:28,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:28,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:28,340 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 59491574, now seen corresponding path program 1 times [2022-07-12 18:56:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:28,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337758146] [2022-07-12 18:56:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:28,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:28,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:28,342 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:28,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 18:56:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:28,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:56:28,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:28,594 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-07-12 18:56:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:28,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:28,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337758146] [2022-07-12 18:56:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337758146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:28,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:56:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165420327] [2022-07-12 18:56:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:28,727 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:29,071 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-12 18:56:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:56:29,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-07-12 18:56:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:29,072 INFO L225 Difference]: With dead ends: 116 [2022-07-12 18:56:29,072 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 18:56:29,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:29,072 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:29,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 465 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2022-07-12 18:56:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 18:56:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-07-12 18:56:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.146067415730337) internal successors, (102), 98 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-07-12 18:56:29,075 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 62 [2022-07-12 18:56:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:29,075 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-07-12 18:56:29,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-07-12 18:56:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 18:56:29,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:29,075 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:29,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:29,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:29,286 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash 59491575, now seen corresponding path program 1 times [2022-07-12 18:56:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:29,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18816023] [2022-07-12 18:56:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:29,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:29,289 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:29,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 18:56:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:29,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 18:56:29,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:29,627 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-07-12 18:56:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:29,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:29,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:29,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18816023] [2022-07-12 18:56:29,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18816023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:29,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:29,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 18:56:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94450727] [2022-07-12 18:56:29,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:29,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:29,977 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:30,384 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-07-12 18:56:30,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:56:30,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-07-12 18:56:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:30,385 INFO L225 Difference]: With dead ends: 126 [2022-07-12 18:56:30,385 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 18:56:30,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:56:30,386 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:30,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 472 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 13 Unchecked, 0.3s Time] [2022-07-12 18:56:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 18:56:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-07-12 18:56:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.175257731958763) internal successors, (114), 105 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-07-12 18:56:30,388 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 62 [2022-07-12 18:56:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:30,388 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-07-12 18:56:30,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-07-12 18:56:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 18:56:30,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:30,389 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:30,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 18:56:30,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:30,599 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:30,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1507930724, now seen corresponding path program 1 times [2022-07-12 18:56:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637120830] [2022-07-12 18:56:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:30,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:30,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:30,601 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:30,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 18:56:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:30,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:56:30,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:31,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:31,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637120830] [2022-07-12 18:56:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637120830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:31,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:31,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:56:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70148198] [2022-07-12 18:56:31,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:31,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:31,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:31,232 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:31,532 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-07-12 18:56:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:56:31,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2022-07-12 18:56:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:31,534 INFO L225 Difference]: With dead ends: 121 [2022-07-12 18:56:31,534 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 18:56:31,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:56:31,535 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 207 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:31,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 432 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-12 18:56:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 18:56:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-07-12 18:56:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 104 states have internal predecessors, (112), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-07-12 18:56:31,539 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 65 [2022-07-12 18:56:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-07-12 18:56:31,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-07-12 18:56:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 18:56:31,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:31,540 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:31,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-12 18:56:31,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:31,752 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1701102758, now seen corresponding path program 1 times [2022-07-12 18:56:31,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:31,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881687299] [2022-07-12 18:56:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:31,754 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:31,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 18:56:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:32,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-12 18:56:32,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:32,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-12 18:56:35,936 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2050 (_ BitVec 8)) (v_ArrVal_2049 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2049) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2050)))) is different from true [2022-07-12 18:56:35,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:35,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:35,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:35,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-12 18:56:36,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:36,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:36,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:36,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:36,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:36,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:36,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:36,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 69 [2022-07-12 18:56:36,415 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:36,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2022-07-12 18:56:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:36,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:36,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881687299] [2022-07-12 18:56:36,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881687299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:36,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:36,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-12 18:56:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508211880] [2022-07-12 18:56:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:36,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 18:56:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 18:56:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=641, Unknown=2, NotChecked=50, Total=756 [2022-07-12 18:56:36,596 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:37,353 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-07-12 18:56:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:56:37,355 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-07-12 18:56:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:37,356 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:56:37,356 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 18:56:37,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=136, Invalid=1198, Unknown=2, NotChecked=70, Total=1406 [2022-07-12 18:56:37,357 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:37,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1084 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 0 Unknown, 343 Unchecked, 0.4s Time] [2022-07-12 18:56:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 18:56:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-12 18:56:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 92 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-07-12 18:56:37,362 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 68 [2022-07-12 18:56:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:37,362 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-07-12 18:56:37,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-07-12 18:56:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 18:56:37,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:37,363 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:37,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-12 18:56:37,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:37,568 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -756328715, now seen corresponding path program 1 times [2022-07-12 18:56:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:37,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601201118] [2022-07-12 18:56:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:37,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:37,570 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:37,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 18:56:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:37,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:56:37,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:37,856 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-07-12 18:56:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:38,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:38,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:38,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601201118] [2022-07-12 18:56:38,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601201118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:38,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:38,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-12 18:56:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514348432] [2022-07-12 18:56:38,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:38,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:38,126 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:38,379 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-12 18:56:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:38,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2022-07-12 18:56:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:38,380 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:56:38,380 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:56:38,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:38,380 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 108 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:38,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 363 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-12 18:56:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:56:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-07-12 18:56:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 91 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-12 18:56:38,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 70 [2022-07-12 18:56:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:38,383 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-12 18:56:38,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-12 18:56:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 18:56:38,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:38,383 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:38,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:38,591 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash 681881017, now seen corresponding path program 1 times [2022-07-12 18:56:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:38,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691469854] [2022-07-12 18:56:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:38,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:38,593 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:38,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 18:56:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:38,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:56:38,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:38,996 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-07-12 18:56:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:39,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:39,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:39,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691469854] [2022-07-12 18:56:39,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691469854] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:39,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:39,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-12 18:56:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487535470] [2022-07-12 18:56:39,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:39,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:39,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:39,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:39,302 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:39,590 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2022-07-12 18:56:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:56:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 76 [2022-07-12 18:56:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:39,591 INFO L225 Difference]: With dead ends: 106 [2022-07-12 18:56:39,591 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 18:56:39,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:39,592 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:39,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 441 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-07-12 18:56:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 18:56:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2022-07-12 18:56:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 90 states have internal predecessors, (93), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-07-12 18:56:39,593 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 76 [2022-07-12 18:56:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:39,594 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-07-12 18:56:39,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-07-12 18:56:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 18:56:39,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:39,594 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:39,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:39,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:39,799 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:39,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash 681881018, now seen corresponding path program 1 times [2022-07-12 18:56:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:39,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591301489] [2022-07-12 18:56:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:39,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:39,801 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:39,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 18:56:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:40,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 18:56:40,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:40,163 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-07-12 18:56:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:40,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:40,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:40,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591301489] [2022-07-12 18:56:40,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591301489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:40,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:40,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:56:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888150975] [2022-07-12 18:56:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:40,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:40,437 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:56:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:40,714 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-07-12 18:56:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:56:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 76 [2022-07-12 18:56:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:40,715 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:56:40,715 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 18:56:40,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:40,716 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:40,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 512 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-12 18:56:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 18:56:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-12 18:56:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 88 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-07-12 18:56:40,718 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 76 [2022-07-12 18:56:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:40,718 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-07-12 18:56:40,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:56:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-07-12 18:56:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 18:56:40,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:40,718 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:40,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:40,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:40,929 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1200120414, now seen corresponding path program 1 times [2022-07-12 18:56:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:40,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027185147] [2022-07-12 18:56:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:40,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:40,931 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:40,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 18:56:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:41,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 18:56:41,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:41,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:41,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:41,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-12 18:56:45,823 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2734 (_ BitVec 8)) (v_ArrVal_2733 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2734)))) is different from true [2022-07-12 18:56:45,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:45,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:45,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-12 18:56:46,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:46,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:46,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:46,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:46,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-12 18:56:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:46,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:46,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-12 18:56:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-12 18:56:51,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:03,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-12 18:57:05,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-12 18:57:07,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse5 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#1| (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))) (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) .cse5)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) .cse5)))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse6 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse11 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse7 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse9 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse7 .cse12) (select .cse7 .cse11)) (select .cse7 .cse10)) (select .cse7 .cse8))))) (store (store (store (store .cse7 .cse8 ((_ extract 7 0) .cse9)) .cse10 ((_ extract 15 8) .cse9)) .cse11 ((_ extract 23 16) .cse9)) .cse12 ((_ extract 31 24) .cse9))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse6 .cse1) (select .cse6 .cse2)) (select .cse6 .cse3)) (select .cse6 .cse4))))))))) is different from false [2022-07-12 18:57:09,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse16 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32))) (.cse15 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) (.cse14 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32))) (.cse12 (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|))) (let ((.cse13 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (concat (concat (concat (select .cse12 .cse16) (select .cse12 .cse15)) (select .cse12 .cse14)) (select .cse12 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))))) (store (store (store (store .cse12 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse13)) .cse14 ((_ extract 15 8) .cse13)) .cse15 ((_ extract 23 16) .cse13)) .cse16 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-12 18:57:11,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv14 32))) (.cse8 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6)) (_ bv4294967295 32)))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse17 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse16 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse15 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse13 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13))))) (store (store (store (store .cse12 .cse13 ((_ extract 7 0) .cse14)) .cse15 ((_ extract 15 8) .cse14)) .cse16 ((_ extract 23 16) .cse14)) .cse17 ((_ extract 31 24) .cse14))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))))) is different from false [2022-07-12 18:57:13,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32))) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (or (= (bvadd (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse5 (select |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6))))) (store (store (store (store .cse12 .cse6 ((_ extract 7 0) .cse13)) .cse8 ((_ extract 15 8) .cse13)) .cse9 ((_ extract 23 16) .cse13)) .cse10 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))))) is different from false [2022-07-12 18:57:16,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:16,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027185147] [2022-07-12 18:57:16,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027185147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:16,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1900726850] [2022-07-12 18:57:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:16,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:16,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:57:16,144 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 18:57:16,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-07-12 18:57:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:17,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-12 18:57:17,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:19,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:19,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:19,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:19,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-12 18:57:21,812 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2733 (_ BitVec 8)) (v_ArrVal_2937 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2937)) |c_#memory_int|)) is different from true [2022-07-12 18:57:21,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:21,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-12 18:57:21,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:21,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:21,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:21,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:21,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:21,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-12 18:57:22,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:22,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-12 18:57:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 18:57:22,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:25,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (not (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-12 18:57:27,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (bvadd (_ bv4294967295 32) (let ((.cse5 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse11 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse10 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse9 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse7 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse8 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse6 .cse11) (select .cse6 .cse10)) (select .cse6 .cse9)) (select .cse6 .cse7))))) (store (store (store (store .cse6 .cse7 ((_ extract 7 0) .cse8)) .cse9 ((_ extract 15 8) .cse8)) .cse10 ((_ extract 23 16) .cse8)) .cse11 ((_ extract 31 24) .cse8))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse5 .cse1) (select .cse5 .cse2)) (select .cse5 .cse3)) (select .cse5 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-12 18:57:29,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse5 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#1| (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))) (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) .cse5)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) .cse5)))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (bvadd (_ bv4294967295 32) (let ((.cse6 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse11 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse7 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse9 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse7 .cse12) (select .cse7 .cse11)) (select .cse7 .cse10)) (select .cse7 .cse8))))) (store (store (store (store .cse7 .cse8 ((_ extract 7 0) .cse9)) .cse10 ((_ extract 15 8) .cse9)) .cse11 ((_ extract 23 16) .cse9)) .cse12 ((_ extract 31 24) .cse9))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse6 .cse1) (select .cse6 .cse2)) (select .cse6 .cse3)) (select .cse6 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-12 18:57:31,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse9 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32))) (.cse8 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) (.cse7 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|))) (let ((.cse6 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (concat (concat (concat (select .cse5 .cse9) (select .cse5 .cse8)) (select .cse5 .cse7)) (select .cse5 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))))) (store (store (store (store .cse5 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse6)) .cse7 ((_ extract 15 8) .cse6)) .cse8 ((_ extract 23 16) .cse6)) .cse9 ((_ extract 31 24) .cse6))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (bvadd (_ bv4294967295 32) (let ((.cse10 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse16 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse15 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse14 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse11 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse11 .cse16) (select .cse11 .cse15)) (select .cse11 .cse14)) (select .cse11 .cse12))))) (store (store (store (store .cse11 .cse12 ((_ extract 7 0) .cse13)) .cse14 ((_ extract 15 8) .cse13)) .cse15 ((_ extract 23 16) .cse13)) .cse16 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse10 .cse1) (select .cse10 .cse2)) (select .cse10 .cse3)) (select .cse10 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-12 18:57:33,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32)))) (or (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv14 32))) (.cse8 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6)) (_ bv4294967295 32)))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))))) (not (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse17 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse16 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse15 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse13 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13))))) (store (store (store (store .cse12 .cse13 ((_ extract 7 0) .cse14)) .cse15 ((_ extract 15 8) .cse14)) .cse16 ((_ extract 23 16) .cse14)) .cse17 ((_ extract 31 24) .cse14))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32)))))) is different from false [2022-07-12 18:57:35,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv15 32))) (.cse2 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv14 32))) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_10| (_ bv12 32))) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (or (not (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (select |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6))))) (store (store (store (store .cse12 .cse6 ((_ extract 7 0) .cse13)) .cse8 ((_ extract 15 8) .cse13)) .cse9 ((_ extract 23 16) .cse13)) .cse10 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_16|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2022-07-12 18:57:36,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1900726850] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:36,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:36,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 44] total 45 [2022-07-12 18:57:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972040948] [2022-07-12 18:57:36,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:36,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 18:57:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 18:57:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3362, Unknown=21, NotChecked=1806, Total=5402 [2022-07-12 18:57:36,076 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:57:39,877 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2733 (_ BitVec 8)) (v_ArrVal_2937 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2937)) |c_#memory_int|)) (exists ((v_ArrVal_2734 (_ BitVec 8)) (v_ArrVal_2733 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2734))))) is different from true [2022-07-12 18:58:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:02,056 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-12 18:58:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 18:58:02,057 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 81 [2022-07-12 18:58:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:02,057 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:58:02,057 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 18:58:02,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 72.7s TimeCoverageRelationStatistics Valid=519, Invalid=6828, Unknown=23, NotChecked=2730, Total=10100 [2022-07-12 18:58:02,059 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:02,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1202 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1540 Invalid, 0 Unknown, 252 Unchecked, 2.6s Time] [2022-07-12 18:58:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 18:58:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-12 18:58:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 88 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:58:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-07-12 18:58:02,061 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 81 [2022-07-12 18:58:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:02,062 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-07-12 18:58:02,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:58:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-07-12 18:58:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 18:58:02,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:02,062 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:02,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:02,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:02,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 18:58:02,472 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:58:02,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2126857693, now seen corresponding path program 1 times [2022-07-12 18:58:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:58:02,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220668026] [2022-07-12 18:58:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:58:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:58:02,475 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:58:02,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 18:58:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:02,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 164 conjunts are in the unsatisfiable core [2022-07-12 18:58:02,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:03,042 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-07-12 18:58:03,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,070 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 21 treesize of output 20 [2022-07-12 18:58:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,103 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-07-12 18:58:03,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,138 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-07-12 18:58:03,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,173 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 21 treesize of output 20 [2022-07-12 18:58:03,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,230 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 21 treesize of output 20 [2022-07-12 18:58:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,270 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-07-12 18:58:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,320 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 21 treesize of output 20 [2022-07-12 18:58:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,359 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 21 treesize of output 20 [2022-07-12 18:58:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,399 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 21 treesize of output 20 [2022-07-12 18:58:03,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,444 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-07-12 18:58:03,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,488 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 21 treesize of output 20 [2022-07-12 18:58:03,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,530 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 21 treesize of output 20 [2022-07-12 18:58:03,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,574 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-07-12 18:58:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,621 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-07-12 18:58:03,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,666 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 21 treesize of output 20 [2022-07-12 18:58:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:03,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:09,073 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3169 (_ BitVec 32)) (v_ArrVal_3172 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3169) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3172)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-12 18:58:09,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:58:09,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:11,563 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3179 (_ BitVec 32)) (v_ArrVal_3178 (_ BitVec 32)) (v_ArrVal_3180 (_ BitVec 32)) (v_ArrVal_3181 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3180) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3181) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3178) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3179)))) is different from true [2022-07-12 18:58:11,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:11,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-12 18:58:11,941 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-07-12 18:58:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:12,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:13,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:58:13,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220668026] [2022-07-12 18:58:13,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220668026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:13,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1720166449] [2022-07-12 18:58:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:13,573 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:58:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:58:13,574 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 18:58:13,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-12 18:58:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:14,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-12 18:58:14,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:14,536 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-07-12 18:58:14,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,550 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 21 treesize of output 20 [2022-07-12 18:58:14,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,571 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-07-12 18:58:14,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,582 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 21 treesize of output 20 [2022-07-12 18:58:14,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,611 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-07-12 18:58:14,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,642 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-07-12 18:58:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,676 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 21 treesize of output 20 [2022-07-12 18:58:14,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,714 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 21 treesize of output 20 [2022-07-12 18:58:14,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,728 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-07-12 18:58:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,771 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-07-12 18:58:14,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,806 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-07-12 18:58:14,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,839 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 21 treesize of output 20 [2022-07-12 18:58:14,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,863 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-07-12 18:58:14,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,906 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 21 treesize of output 20 [2022-07-12 18:58:14,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,951 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 21 treesize of output 20 [2022-07-12 18:58:14,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:14,989 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 21 treesize of output 20 [2022-07-12 18:58:15,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:15,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:17,184 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3411 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3411)))) is different from true [2022-07-12 18:58:17,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 18:58:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:17,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:17,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 57 [2022-07-12 18:58:19,764 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3421 (_ BitVec 32)) (v_ArrVal_3420 (_ BitVec 32)) (v_ArrVal_3418 (_ BitVec 32)) (v_ArrVal_3419 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3420) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3421) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3418) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3419)))) is different from true [2022-07-12 18:58:19,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:19,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:19,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 57 [2022-07-12 18:58:20,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:20,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 49 [2022-07-12 18:58:20,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:20,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 26 [2022-07-12 18:58:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:20,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:22,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1720166449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:22,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:58:22,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46] total 60 [2022-07-12 18:58:22,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864022934] [2022-07-12 18:58:22,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:22,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 18:58:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:58:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 18:58:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=5003, Unknown=5, NotChecked=580, Total=5852 [2022-07-12 18:58:22,481 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 61 states, 58 states have (on average 1.896551724137931) internal successors, (110), 57 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:58:28,087 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3169 (_ BitVec 32)) (v_ArrVal_3172 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3169) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3172)) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3411 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3411))))) is different from true [2022-07-12 18:58:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:37,367 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-07-12 18:58:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 18:58:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.896551724137931) internal successors, (110), 57 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 82 [2022-07-12 18:58:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:37,369 INFO L225 Difference]: With dead ends: 96 [2022-07-12 18:58:37,369 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:58:37,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 107 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=554, Invalid=10171, Unknown=7, NotChecked=1040, Total=11772 [2022-07-12 18:58:37,371 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 206 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:37,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1185 Invalid, 2660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2181 Invalid, 0 Unknown, 420 Unchecked, 4.6s Time] [2022-07-12 18:58:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:58:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 18:58:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 87 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:58:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-12 18:58:37,373 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 82 [2022-07-12 18:58:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:37,373 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-12 18:58:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.896551724137931) internal successors, (110), 57 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:58:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-12 18:58:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 18:58:37,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:37,374 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:37,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:37,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:37,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 18:58:37,775 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:58:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1508079198, now seen corresponding path program 1 times [2022-07-12 18:58:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:58:37,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393836136] [2022-07-12 18:58:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:58:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:58:37,777 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:58:37,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 18:58:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:38,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 164 conjunts are in the unsatisfiable core [2022-07-12 18:58:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:38,455 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-07-12 18:58:38,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,489 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-07-12 18:58:38,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,537 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-07-12 18:58:38,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,571 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-07-12 18:58:38,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,616 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 21 treesize of output 20 [2022-07-12 18:58:38,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,662 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-07-12 18:58:38,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,716 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 21 treesize of output 20 [2022-07-12 18:58:38,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,799 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-07-12 18:58:38,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,854 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 21 treesize of output 20 [2022-07-12 18:58:38,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,914 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-07-12 18:58:38,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,001 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 21 treesize of output 20 [2022-07-12 18:58:39,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,081 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 21 treesize of output 20 [2022-07-12 18:58:39,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,169 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 21 treesize of output 20 [2022-07-12 18:58:39,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,231 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 21 treesize of output 20 [2022-07-12 18:58:39,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,309 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 21 treesize of output 20 [2022-07-12 18:58:39,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,382 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 21 treesize of output 20 [2022-07-12 18:58:39,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:39,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:45,578 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3651 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3651)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 18:58:45,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:58:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:45,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:48,035 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3661 (_ BitVec 32)) (v_ArrVal_3662 (_ BitVec 32)) (v_ArrVal_3658 (_ BitVec 32)) (v_ArrVal_3659 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3658) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3659) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3661) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3662)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 18:58:48,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:48,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:48,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-12 18:58:48,416 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-07-12 18:58:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:48,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:49,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:58:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393836136] [2022-07-12 18:58:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393836136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1779871646] [2022-07-12 18:58:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:58:49,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:58:49,762 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 18:58:49,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-12 18:58:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:50,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 160 conjunts are in the unsatisfiable core [2022-07-12 18:58:50,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:50,577 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 14 treesize of output 10 [2022-07-12 18:58:50,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,607 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-07-12 18:58:50,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,622 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 21 treesize of output 20 [2022-07-12 18:58:50,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,659 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 21 treesize of output 20 [2022-07-12 18:58:50,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,688 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-07-12 18:58:50,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,723 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 21 treesize of output 20 [2022-07-12 18:58:50,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,767 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 21 treesize of output 20 [2022-07-12 18:58:50,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,782 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 21 treesize of output 20 [2022-07-12 18:58:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,818 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 21 treesize of output 20 [2022-07-12 18:58:50,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,836 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-07-12 18:58:50,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,854 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-07-12 18:58:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,904 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-07-12 18:58:50,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,954 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-07-12 18:58:50,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:50,994 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 21 treesize of output 20 [2022-07-12 18:58:51,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,011 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 21 treesize of output 20 [2022-07-12 18:58:51,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,028 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 21 treesize of output 20 [2022-07-12 18:58:51,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:51,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:54,682 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3891 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3891)))) is different from true [2022-07-12 18:58:54,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:58:54,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:54,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:56,854 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3902 (_ BitVec 32)) (v_ArrVal_3900 (_ BitVec 32)) (v_ArrVal_3901 (_ BitVec 32)) (v_ArrVal_3898 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3902) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3900) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3901) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3898)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 18:58:56,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:56,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:57,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-12 18:58:57,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:57,159 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 15 treesize of output 15 [2022-07-12 18:58:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:57,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:59,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1779871646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:59,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:58:59,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47] total 53 [2022-07-12 18:58:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779462074] [2022-07-12 18:58:59,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 18:58:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:58:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 18:58:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3450, Unknown=5, NotChecked=484, Total=4160 [2022-07-12 18:58:59,019 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 50 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:59:03,150 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3891 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3891)))) (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3651 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3650) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3651)) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 18:59:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:10,622 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-07-12 18:59:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 18:59:10,623 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 50 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 83 [2022-07-12 18:59:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:10,623 INFO L225 Difference]: With dead ends: 92 [2022-07-12 18:59:10,623 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:59:10,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 129 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=392, Invalid=5473, Unknown=7, NotChecked=770, Total=6642 [2022-07-12 18:59:10,625 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:10,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 796 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1639 Invalid, 0 Unknown, 389 Unchecked, 2.6s Time] [2022-07-12 18:59:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:59:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-12 18:59:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:59:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-07-12 18:59:10,627 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 83 [2022-07-12 18:59:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:10,628 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-07-12 18:59:10,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 50 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:59:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-07-12 18:59:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 18:59:10,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:10,628 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:10,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:10,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:11,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:11,048 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:59:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 102095468, now seen corresponding path program 1 times [2022-07-12 18:59:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487655713] [2022-07-12 18:59:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:11,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:11,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:11,050 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:11,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-12 18:59:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:11,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:59:11,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:11,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2022-07-12 18:59:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 18:59:12,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:16,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:16,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487655713] [2022-07-12 18:59:16,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487655713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:16,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120569779] [2022-07-12 18:59:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:16,573 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:59:16,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:59:16,574 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 18:59:16,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-12 18:59:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:17,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:59:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:17,737 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-12 18:59:17,737 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 18 treesize of output 25 [2022-07-12 18:59:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 18:59:18,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:22,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1120569779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:22,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:22,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-12 18:59:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291618323] [2022-07-12 18:59:22,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:22,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:59:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:22,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:59:22,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=721, Unknown=2, NotChecked=0, Total=812 [2022-07-12 18:59:22,483 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 18:59:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:22,708 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-07-12 18:59:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:59:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 90 [2022-07-12 18:59:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:22,709 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:59:22,709 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 18:59:22,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 314 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=117, Invalid=937, Unknown=2, NotChecked=0, Total=1056 [2022-07-12 18:59:22,710 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:22,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 491 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2022-07-12 18:59:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 18:59:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 18:59:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07-12 18:59:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 18:59:22,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-07-12 18:59:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:22,710 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 18:59:22,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 18:59:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 18:59:22,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 18:59:22,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-07-12 18:59:22,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-07-12 18:59:22,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2022-07-12 18:59:22,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2022-07-12 18:59:22,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2022-07-12 18:59:22,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:22,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:23,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 18:59:23,116 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:23,118 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:59:23,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:59:23 BoogieIcfgContainer [2022-07-12 18:59:23,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:59:23,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:59:23,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:59:23,120 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:59:23,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:14" (3/4) ... [2022-07-12 18:59:23,122 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 18:59:23,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-12 18:59:23,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-07-12 18:59:23,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-07-12 18:59:23,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2022-07-12 18:59:23,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 18:59:23,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 18:59:23,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 18:59:23,175 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 18:59:23,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:59:23,179 INFO L158 Benchmark]: Toolchain (without parser) took 189984.23ms. Allocated memory was 58.7MB in the beginning and 117.4MB in the end (delta: 58.7MB). Free memory was 36.1MB in the beginning and 49.0MB in the end (delta: -12.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,179 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:59:23,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.05ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 35.8MB in the beginning and 51.1MB in the end (delta: -15.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.65ms. Allocated memory is still 86.0MB. Free memory was 51.1MB in the beginning and 67.9MB in the end (delta: -16.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,182 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 86.0MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,182 INFO L158 Benchmark]: RCFGBuilder took 521.76ms. Allocated memory is still 86.0MB. Free memory was 65.8MB in the beginning and 66.3MB in the end (delta: -544.8kB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,182 INFO L158 Benchmark]: TraceAbstraction took 188757.22ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 65.9MB in the beginning and 53.9MB in the end (delta: 12.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,183 INFO L158 Benchmark]: Witness Printer took 55.44ms. Allocated memory is still 117.4MB. Free memory was 53.9MB in the beginning and 49.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 18:59:23,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.05ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 35.8MB in the beginning and 51.1MB in the end (delta: -15.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.65ms. Allocated memory is still 86.0MB. Free memory was 51.1MB in the beginning and 67.9MB in the end (delta: -16.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 86.0MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.76ms. Allocated memory is still 86.0MB. Free memory was 65.8MB in the beginning and 66.3MB in the end (delta: -544.8kB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 188757.22ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 65.9MB in the beginning and 53.9MB in the end (delta: 12.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 55.44ms. Allocated memory is still 117.4MB. Free memory was 53.9MB in the beginning and 49.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 770]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 188.7s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 59.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2820 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2797 mSDsluCounter, 18034 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1777 IncrementalHoareTripleChecker+Unchecked, 15430 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9880 IncrementalHoareTripleChecker+Invalid, 12044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 2604 mSDtfsCounter, 9880 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2515 GetRequests, 1795 SyntacticMatches, 48 SemanticMatches, 672 ConstructedPredicates, 26 IntricatePredicates, 4 DeprecatedPredicates, 7196 ImplicationChecksByTransitivity, 142.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=25, InterpolantAutomatonStates: 459, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 351 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 110.6s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2000 ConstructedInterpolants, 241 QuantifiedInterpolants, 21007 SizeOfPredicates, 898 NumberOfNonLiveVariables, 11729 ConjunctsInSsa, 1540 ConjunctsInUnsatCore, 43 InterpolantComputations, 25 PerfectInterpolantSequences, 3103/3985 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-12 18:59:23,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE